TSTP Solution File: SWV181+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV181+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.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.12s 0.35s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 7 unt; 0 def)
% Number of atoms : 155 ( 30 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 180 ( 54 ~; 50 |; 50 &)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 48 (; 47 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X,Y,Z] :
( ( gt(X,Y)
& gt(Y,Z) )
=> gt(X,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y] :
( ( leq(X,Y)
& X != Y )
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,C,n0) = init )
& ( gt(loopcounter,n0)
=> ! [D] :
( ( leq(n0,D)
& leq(D,n4) )
=> a_select2(mu_init,D) = init ) )
& ( gt(loopcounter,n0)
=> ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> a_select2(rho_init,E) = init ) )
& ( gt(loopcounter,n0)
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select2(sigma_init,F) = init ) ) )
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(muold_init,G) = init ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,C,n0) = init )
& ( gt(loopcounter,n0)
=> ! [D] :
( ( leq(n0,D)
& leq(D,n4) )
=> a_select2(mu_init,D) = init ) )
& ( gt(loopcounter,n0)
=> ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> a_select2(rho_init,E) = init ) )
& ( gt(loopcounter,n0)
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> a_select2(sigma_init,F) = init ) ) )
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> a_select2(muold_init,G) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f95,plain,
! [X,Y,Z] :
( ~ gt(X,Y)
| ~ gt(Y,Z)
| gt(X,Z) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f96,plain,
! [X,Z] :
( ! [Y] :
( ~ gt(X,Y)
| ~ gt(Y,Z) )
| gt(X,Z) ),
inference(miniscoping,[status(esa)],[f95]) ).
fof(f97,plain,
! [X0,X1,X2] :
( ~ gt(X0,X1)
| ~ gt(X1,X2)
| gt(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f96]) ).
fof(f98,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f113,plain,
! [X,Y] :
( ~ leq(X,Y)
| X = Y
| gt(Y,X) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f114,plain,
! [X0,X1] :
( ~ leq(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f113]) ).
fof(f251,plain,
( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,C,n0) = init )
& ( ~ gt(loopcounter,n0)
| ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n4)
| a_select2(mu_init,D) = init ) )
& ( ~ gt(loopcounter,n0)
| ! [E] :
( ~ leq(n0,E)
| ~ leq(E,n4)
| a_select2(rho_init,E) = init ) )
& ( ~ gt(loopcounter,n0)
| ! [F] :
( ~ leq(n0,F)
| ~ leq(F,n4)
| a_select2(sigma_init,F) = init ) )
& ? [G] :
( leq(n0,G)
& leq(G,n4)
& a_select2(muold_init,G) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( leq(tptp_float_0_001,pv76)
& leq(n1,loopcounter)
& gt(n1,loopcounter)
& ! [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_select3(center_init,C,n0) = init )
& ( ~ gt(loopcounter,n0)
| ! [D] :
( ~ leq(n0,D)
| ~ leq(D,n4)
| a_select2(mu_init,D) = init ) )
& ( ~ gt(loopcounter,n0)
| ! [E] :
( ~ leq(n0,E)
| ~ leq(E,n4)
| a_select2(rho_init,E) = init ) )
& ( ~ gt(loopcounter,n0)
| ! [F] :
( ~ leq(n0,F)
| ~ leq(F,n4)
| a_select2(sigma_init,F) = init ) )
& leq(n0,sk0_23)
& leq(sk0_23,n4)
& a_select2(muold_init,sk0_23) != init ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f254,plain,
leq(n1,loopcounter),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f255,plain,
gt(n1,loopcounter),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f672,plain,
( spl0_34
<=> n1 = loopcounter ),
introduced(split_symbol_definition) ).
fof(f673,plain,
( n1 = loopcounter
| ~ spl0_34 ),
inference(component_clause,[status(thm)],[f672]) ).
fof(f675,plain,
( spl0_35
<=> gt(loopcounter,n1) ),
introduced(split_symbol_definition) ).
fof(f676,plain,
( gt(loopcounter,n1)
| ~ spl0_35 ),
inference(component_clause,[status(thm)],[f675]) ).
fof(f678,plain,
( n1 = loopcounter
| gt(loopcounter,n1) ),
inference(resolution,[status(thm)],[f114,f254]) ).
fof(f679,plain,
( spl0_34
| spl0_35 ),
inference(split_clause,[status(thm)],[f678,f672,f675]) ).
fof(f800,plain,
! [X0] :
( ~ gt(X0,loopcounter)
| gt(X0,n1)
| ~ spl0_35 ),
inference(resolution,[status(thm)],[f676,f97]) ).
fof(f902,plain,
( gt(n1,n1)
| ~ spl0_35 ),
inference(resolution,[status(thm)],[f255,f800]) ).
fof(f903,plain,
( $false
| ~ spl0_35 ),
inference(forward_subsumption_resolution,[status(thm)],[f902,f98]) ).
fof(f904,plain,
~ spl0_35,
inference(contradiction_clause,[status(thm)],[f903]) ).
fof(f908,plain,
( gt(n1,n1)
| ~ spl0_34 ),
inference(backward_demodulation,[status(thm)],[f673,f255]) ).
fof(f909,plain,
( $false
| ~ spl0_34 ),
inference(forward_subsumption_resolution,[status(thm)],[f908,f98]) ).
fof(f910,plain,
~ spl0_34,
inference(contradiction_clause,[status(thm)],[f909]) ).
fof(f911,plain,
$false,
inference(sat_refutation,[status(thm)],[f679,f904,f910]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV181+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue May 30 11:38:07 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % Drodi V3.5.1
% 0.12/0.35 % Refutation found
% 0.12/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.36 % Elapsed time: 0.025389 seconds
% 0.12/0.36 % CPU time: 0.055408 seconds
% 0.12/0.36 % Memory used: 16.159 MB
%------------------------------------------------------------------------------