TSTP Solution File: SWV184+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV184+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 31 12:40:51 EDT 2023
% Result : Theorem 0.15s 0.33s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWV184+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n007.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 11:27:47 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.33 % Refutation found
% 0.15/0.33 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.33 % SZS output start CNFRefutation for theBenchmark
% 0.15/0.33 fof(f53,conjecture,(
% 0.15/0.33 ( ( gt(loopcounter,n1)& (! [A] :( ( leq(n0,A)& leq(A,n135299) )=> (! [B] :( ( leq(n0,B)& leq(B,n4) )=> a_select3(q_init,A,B) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,n4) )=> a_select2(rho_init,C) = init ))& (! [D] :( ( leq(n0,D)& leq(D,n4) )=> a_select3(center_init,D,n0) = init ))& ( gt(loopcounter,n1)=> (! [E] :( ( leq(n0,E)& leq(E,n4) )=> a_select2(muold_init,E) = init ) ))& ( gt(loopcounter,n1)=> (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select2(rhoold_init,F) = init ) ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(sigmaold_init,G) = init ) )) )=> (! [H] :( ( leq(n0,H)& leq(H,n4) )=> a_select2(sigmaold_init,H) = init ) )) ),
% 0.15/0.33 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.15/0.33 fof(f54,negated_conjecture,(
% 0.15/0.33 ~(( ( gt(loopcounter,n1)& (! [A] :( ( leq(n0,A)& leq(A,n135299) )=> (! [B] :( ( leq(n0,B)& leq(B,n4) )=> a_select3(q_init,A,B) = init ) )))& (! [C] :( ( leq(n0,C)& leq(C,n4) )=> a_select2(rho_init,C) = init ))& (! [D] :( ( leq(n0,D)& leq(D,n4) )=> a_select3(center_init,D,n0) = init ))& ( gt(loopcounter,n1)=> (! [E] :( ( leq(n0,E)& leq(E,n4) )=> a_select2(muold_init,E) = init ) ))& ( gt(loopcounter,n1)=> (! [F] :( ( leq(n0,F)& leq(F,n4) )=> a_select2(rhoold_init,F) = init ) ))& ( gt(loopcounter,n1)=> (! [G] :( ( leq(n0,G)& leq(G,n4) )=> a_select2(sigmaold_init,G) = init ) )) )=> (! [H] :( ( leq(n0,H)& leq(H,n4) )=> a_select2(sigmaold_init,H) = init ) )) )),
% 0.15/0.33 inference(negated_conjecture,[status(cth)],[f53])).
% 0.15/0.33 fof(f251,plain,(
% 0.15/0.33 (((((((gt(loopcounter,n1)&(![A]: ((~leq(n0,A)|~leq(A,n135299))|(![B]: ((~leq(n0,B)|~leq(B,n4))|a_select3(q_init,A,B)=init)))))&(![C]: ((~leq(n0,C)|~leq(C,n4))|a_select2(rho_init,C)=init)))&(![D]: ((~leq(n0,D)|~leq(D,n4))|a_select3(center_init,D,n0)=init)))&(~gt(loopcounter,n1)|(![E]: ((~leq(n0,E)|~leq(E,n4))|a_select2(muold_init,E)=init))))&(~gt(loopcounter,n1)|(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select2(rhoold_init,F)=init))))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(sigmaold_init,G)=init))))&(?[H]: ((leq(n0,H)&leq(H,n4))&~a_select2(sigmaold_init,H)=init)))),
% 0.15/0.33 inference(pre_NNF_transformation,[status(esa)],[f54])).
% 0.15/0.33 fof(f252,plain,(
% 0.15/0.33 ((((((gt(loopcounter,n1)&(![A]: ((~leq(n0,A)|~leq(A,n135299))|(![B]: ((~leq(n0,B)|~leq(B,n4))|a_select3(q_init,A,B)=init)))))&(![C]: ((~leq(n0,C)|~leq(C,n4))|a_select2(rho_init,C)=init)))&(![D]: ((~leq(n0,D)|~leq(D,n4))|a_select3(center_init,D,n0)=init)))&(~gt(loopcounter,n1)|(![E]: ((~leq(n0,E)|~leq(E,n4))|a_select2(muold_init,E)=init))))&(~gt(loopcounter,n1)|(![F]: ((~leq(n0,F)|~leq(F,n4))|a_select2(rhoold_init,F)=init))))&(~gt(loopcounter,n1)|(![G]: ((~leq(n0,G)|~leq(G,n4))|a_select2(sigmaold_init,G)=init))))&((leq(n0,sk0_23)&leq(sk0_23,n4))&~a_select2(sigmaold_init,sk0_23)=init)),
% 0.15/0.33 inference(skolemization,[status(esa)],[f251])).
% 0.15/0.33 fof(f253,plain,(
% 0.15/0.33 gt(loopcounter,n1)),
% 0.15/0.33 inference(cnf_transformation,[status(esa)],[f252])).
% 0.15/0.33 fof(f259,plain,(
% 0.15/0.33 ![X0]: (~gt(loopcounter,n1)|~leq(n0,X0)|~leq(X0,n4)|a_select2(sigmaold_init,X0)=init)),
% 0.15/0.33 inference(cnf_transformation,[status(esa)],[f252])).
% 0.15/0.33 fof(f260,plain,(
% 0.15/0.33 leq(n0,sk0_23)),
% 0.15/0.33 inference(cnf_transformation,[status(esa)],[f252])).
% 0.15/0.33 fof(f261,plain,(
% 0.15/0.33 leq(sk0_23,n4)),
% 0.15/0.33 inference(cnf_transformation,[status(esa)],[f252])).
% 0.15/0.33 fof(f262,plain,(
% 0.15/0.33 ~a_select2(sigmaold_init,sk0_23)=init),
% 0.15/0.33 inference(cnf_transformation,[status(esa)],[f252])).
% 0.15/0.33 fof(f335,plain,(
% 0.15/0.33 spl0_0 <=> gt(loopcounter,n1)),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f337,plain,(
% 0.15/0.33 ~gt(loopcounter,n1)|spl0_0),
% 0.15/0.33 inference(component_clause,[status(thm)],[f335])).
% 0.15/0.33 fof(f346,plain,(
% 0.15/0.33 spl0_3 <=> ~leq(n0,X0)|~leq(X0,n4)|a_select2(sigmaold_init,X0)=init),
% 0.15/0.33 introduced(split_symbol_definition)).
% 0.15/0.33 fof(f347,plain,(
% 0.15/0.33 ![X0]: (~leq(n0,X0)|~leq(X0,n4)|a_select2(sigmaold_init,X0)=init|~spl0_3)),
% 0.15/0.33 inference(component_clause,[status(thm)],[f346])).
% 0.15/0.33 fof(f349,plain,(
% 0.15/0.33 ~spl0_0|spl0_3),
% 0.15/0.33 inference(split_clause,[status(thm)],[f259,f335,f346])).
% 0.15/0.33 fof(f397,plain,(
% 0.15/0.33 $false|spl0_0),
% 0.16/0.56 inference(forward_subsumption_resolution,[status(thm)],[f337,f253])).
% 0.16/0.56 fof(f398,plain,(
% 0.16/0.56 spl0_0),
% 0.16/0.56 inference(contradiction_clause,[status(thm)],[f397])).
% 0.16/0.56 fof(f399,plain,(
% 0.16/0.56 spl0_4 <=> leq(n0,sk0_23)),
% 0.16/0.56 introduced(split_symbol_definition)).
% 0.16/0.56 fof(f401,plain,(
% 0.16/0.56 ~leq(n0,sk0_23)|spl0_4),
% 0.16/0.56 inference(component_clause,[status(thm)],[f399])).
% 0.16/0.56 fof(f402,plain,(
% 0.16/0.56 spl0_5 <=> leq(sk0_23,n4)),
% 0.16/0.56 introduced(split_symbol_definition)).
% 0.16/0.56 fof(f404,plain,(
% 0.16/0.56 ~leq(sk0_23,n4)|spl0_5),
% 0.16/0.56 inference(component_clause,[status(thm)],[f402])).
% 0.16/0.56 fof(f405,plain,(
% 0.16/0.56 ~leq(n0,sk0_23)|~leq(sk0_23,n4)|~spl0_3),
% 0.16/0.56 inference(resolution,[status(thm)],[f347,f262])).
% 0.16/0.56 fof(f406,plain,(
% 0.16/0.56 ~spl0_4|~spl0_5|~spl0_3),
% 0.16/0.56 inference(split_clause,[status(thm)],[f405,f399,f402,f346])).
% 0.16/0.56 fof(f407,plain,(
% 0.16/0.56 $false|spl0_4),
% 0.16/0.56 inference(forward_subsumption_resolution,[status(thm)],[f401,f260])).
% 0.16/0.56 fof(f408,plain,(
% 0.16/0.56 spl0_4),
% 0.16/0.56 inference(contradiction_clause,[status(thm)],[f407])).
% 0.16/0.56 fof(f409,plain,(
% 0.16/0.56 $false|spl0_5),
% 0.16/0.56 inference(forward_subsumption_resolution,[status(thm)],[f404,f261])).
% 0.16/0.56 fof(f410,plain,(
% 0.16/0.56 spl0_5),
% 0.16/0.56 inference(contradiction_clause,[status(thm)],[f409])).
% 0.16/0.56 fof(f411,plain,(
% 0.16/0.56 $false),
% 0.16/0.56 inference(sat_refutation,[status(thm)],[f349,f398,f406,f408,f410])).
% 0.16/0.56 % SZS output end CNFRefutation for theBenchmark.p
% 0.16/0.56 % Elapsed time: 0.025041 seconds
% 0.16/0.56 % CPU time: 0.018011 seconds
% 0.16/0.56 % Memory used: 4.041 MB
%------------------------------------------------------------------------------