TSTP Solution File: SWV188+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV188+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n013.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:52 EDT 2023
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 43 ( 11 unt; 0 def)
% Number of atoms : 183 ( 38 equ)
% Maximal formula atoms : 26 ( 4 avg)
% Number of connectives : 206 ( 66 ~; 64 |; 45 &)
% ( 3 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 15 con; 0-3 aty)
% Number of variables : 61 (; 60 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X,Y] :
( ( leq(X,Y)
& X != Y )
=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( ! [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,tptp_minus_1) )
=> a_select2(mu_init,H) = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( ! [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,tptp_minus_1) )
=> a_select2(mu_init,H) = init ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f61,axiom,
gt(n0,tptp_minus_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f85,axiom,
! [X] :
( ( leq(n0,X)
& leq(X,n0) )
=> X = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f98,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f100,plain,
! [X,Y,Z] :
( ~ leq(X,Y)
| ~ leq(Y,Z)
| leq(X,Z) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f101,plain,
! [X,Z] :
( ! [Y] :
( ~ leq(X,Y)
| ~ leq(Y,Z) )
| leq(X,Z) ),
inference(miniscoping,[status(esa)],[f100]) ).
fof(f102,plain,
! [X0,X1,X2] :
( ~ leq(X0,X1)
| ~ leq(X1,X2)
| leq(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f101]) ).
fof(f111,plain,
! [X,Y] :
( ~ gt(Y,X)
| leq(X,Y) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f112,plain,
! [X0,X1] :
( ~ gt(X0,X1)
| leq(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f111]) ).
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,
( ! [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,tptp_minus_1)
& a_select2(mu_init,H) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( ! [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,tptp_minus_1)
& a_select2(mu_init,sk0_23) != init ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f259,plain,
leq(n0,sk0_23),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f260,plain,
leq(sk0_23,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f268,plain,
gt(n0,tptp_minus_1),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f294,plain,
! [X] :
( ~ leq(n0,X)
| ~ leq(X,n0)
| X = n0 ),
inference(pre_NNF_transformation,[status(esa)],[f85]) ).
fof(f295,plain,
! [X0] :
( ~ leq(n0,X0)
| ~ leq(X0,n0)
| X0 = n0 ),
inference(cnf_transformation,[status(esa)],[f294]) ).
fof(f373,plain,
! [X0] :
( ~ leq(X0,sk0_23)
| leq(X0,tptp_minus_1) ),
inference(resolution,[status(thm)],[f102,f260]) ).
fof(f577,plain,
leq(n0,tptp_minus_1),
inference(resolution,[status(thm)],[f373,f259]) ).
fof(f594,plain,
leq(tptp_minus_1,n0),
inference(resolution,[status(thm)],[f112,f268]) ).
fof(f646,plain,
( spl0_32
<=> n0 = tptp_minus_1 ),
introduced(split_symbol_definition) ).
fof(f647,plain,
( n0 = tptp_minus_1
| ~ spl0_32 ),
inference(component_clause,[status(thm)],[f646]) ).
fof(f649,plain,
( spl0_33
<=> gt(tptp_minus_1,n0) ),
introduced(split_symbol_definition) ).
fof(f650,plain,
( gt(tptp_minus_1,n0)
| ~ spl0_33 ),
inference(component_clause,[status(thm)],[f649]) ).
fof(f652,plain,
( n0 = tptp_minus_1
| gt(tptp_minus_1,n0) ),
inference(resolution,[status(thm)],[f114,f577]) ).
fof(f653,plain,
( spl0_32
| spl0_33 ),
inference(split_clause,[status(thm)],[f652,f646,f649]) ).
fof(f736,plain,
( gt(n0,n0)
| ~ spl0_32 ),
inference(backward_demodulation,[status(thm)],[f647,f268]) ).
fof(f737,plain,
( $false
| ~ spl0_32 ),
inference(forward_subsumption_resolution,[status(thm)],[f736,f98]) ).
fof(f738,plain,
~ spl0_32,
inference(contradiction_clause,[status(thm)],[f737]) ).
fof(f777,plain,
( leq(n0,tptp_minus_1)
| ~ spl0_33 ),
inference(resolution,[status(thm)],[f650,f112]) ).
fof(f1184,plain,
( spl0_79
<=> leq(tptp_minus_1,n0) ),
introduced(split_symbol_definition) ).
fof(f1186,plain,
( ~ leq(tptp_minus_1,n0)
| spl0_79 ),
inference(component_clause,[status(thm)],[f1184]) ).
fof(f1187,plain,
( ~ leq(tptp_minus_1,n0)
| tptp_minus_1 = n0
| ~ spl0_33 ),
inference(resolution,[status(thm)],[f295,f777]) ).
fof(f1188,plain,
( ~ spl0_79
| spl0_32
| ~ spl0_33 ),
inference(split_clause,[status(thm)],[f1187,f1184,f646,f649]) ).
fof(f1209,plain,
( $false
| spl0_79 ),
inference(forward_subsumption_resolution,[status(thm)],[f1186,f594]) ).
fof(f1210,plain,
spl0_79,
inference(contradiction_clause,[status(thm)],[f1209]) ).
fof(f1211,plain,
$false,
inference(sat_refutation,[status(thm)],[f653,f738,f1188,f1210]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV188+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 11:32:20 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.5.1
% 0.13/0.37 % Refutation found
% 0.13/0.37 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.37 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.39 % Elapsed time: 0.037627 seconds
% 0.13/0.39 % CPU time: 0.110034 seconds
% 0.13/0.39 % Memory used: 20.267 MB
%------------------------------------------------------------------------------