TSTP Solution File: SWV174+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV174+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n011.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 : Tue Apr 30 20:46:10 EDT 2024
% Result : Theorem 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 34 ( 10 unt; 0 def)
% Number of atoms : 125 ( 14 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 129 ( 38 ~; 36 |; 38 &)
% ( 5 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-3 aty)
% Number of variables : 30 ( 28 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f10,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [A] :
( ( leq(n0,A)
& leq(A,pred(pv10)) )
=> ! [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 ) )
=> ! [D,E] :
( ( leq(n0,D)
& leq(n0,E)
& leq(D,n135299)
& leq(E,n4) )
=> ( gt(pv10,D)
=> a_select3(q_init,D,E) = init ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [A] :
( ( leq(n0,A)
& leq(A,pred(pv10)) )
=> ! [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 ) )
=> ! [D,E] :
( ( leq(n0,D)
& leq(n0,E)
& leq(D,n135299)
& leq(E,n4) )
=> ( gt(pv10,D)
=> a_select3(q_init,D,E) = init ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f115,plain,
! [X,Y] :
( ( ~ leq(X,pred(Y))
| gt(Y,X) )
& ( leq(X,pred(Y))
| ~ gt(Y,X) ) ),
inference(NNF_transformation,[status(esa)],[f10]) ).
fof(f116,plain,
( ! [X,Y] :
( ~ leq(X,pred(Y))
| gt(Y,X) )
& ! [X,Y] :
( leq(X,pred(Y))
| ~ gt(Y,X) ) ),
inference(miniscoping,[status(esa)],[f115]) ).
fof(f118,plain,
! [X0,X1] :
( leq(X0,pred(X1))
| ~ gt(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f116]) ).
fof(f251,plain,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,pred(pv10))
| ! [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 )
& ? [D,E] :
( leq(n0,D)
& leq(n0,E)
& leq(D,n135299)
& leq(E,n4)
& gt(pv10,D)
& a_select3(q_init,D,E) != init ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
( leq(n0,pv10)
& leq(pv10,n135299)
& ! [A] :
( ~ leq(n0,A)
| ~ leq(A,pred(pv10))
| ! [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 )
& leq(n0,sk0_23)
& leq(n0,sk0_24)
& leq(sk0_23,n135299)
& leq(sk0_24,n4)
& gt(pv10,sk0_23)
& a_select3(q_init,sk0_23,sk0_24) != init ),
inference(skolemization,[status(esa)],[f251]) ).
fof(f255,plain,
! [X0,X1] :
( ~ leq(n0,X0)
| ~ leq(X0,pred(pv10))
| ~ leq(n0,X1)
| ~ leq(X1,n4)
| a_select3(q_init,X0,X1) = init ),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f257,plain,
leq(n0,sk0_23),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f258,plain,
leq(n0,sk0_24),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f260,plain,
leq(sk0_24,n4),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f261,plain,
gt(pv10,sk0_23),
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f262,plain,
a_select3(q_init,sk0_23,sk0_24) != init,
inference(cnf_transformation,[status(esa)],[f252]) ).
fof(f340,plain,
( spl0_1
<=> leq(n0,sk0_24) ),
introduced(split_symbol_definition) ).
fof(f342,plain,
( ~ leq(n0,sk0_24)
| spl0_1 ),
inference(component_clause,[status(thm)],[f340]) ).
fof(f345,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f342,f258]) ).
fof(f346,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f345]) ).
fof(f1058,plain,
( spl0_52
<=> leq(sk0_24,n4) ),
introduced(split_symbol_definition) ).
fof(f1060,plain,
( ~ leq(sk0_24,n4)
| spl0_52 ),
inference(component_clause,[status(thm)],[f1058]) ).
fof(f1063,plain,
( $false
| spl0_52 ),
inference(forward_subsumption_resolution,[status(thm)],[f1060,f260]) ).
fof(f1064,plain,
spl0_52,
inference(contradiction_clause,[status(thm)],[f1063]) ).
fof(f1109,plain,
( spl0_53
<=> leq(n0,sk0_23) ),
introduced(split_symbol_definition) ).
fof(f1111,plain,
( ~ leq(n0,sk0_23)
| spl0_53 ),
inference(component_clause,[status(thm)],[f1109]) ).
fof(f1112,plain,
( spl0_54
<=> leq(sk0_23,pred(pv10)) ),
introduced(split_symbol_definition) ).
fof(f1114,plain,
( ~ leq(sk0_23,pred(pv10))
| spl0_54 ),
inference(component_clause,[status(thm)],[f1112]) ).
fof(f1115,plain,
( ~ leq(n0,sk0_23)
| ~ leq(sk0_23,pred(pv10))
| ~ leq(n0,sk0_24)
| ~ leq(sk0_24,n4) ),
inference(resolution,[status(thm)],[f262,f255]) ).
fof(f1116,plain,
( ~ spl0_53
| ~ spl0_54
| ~ spl0_1
| ~ spl0_52 ),
inference(split_clause,[status(thm)],[f1115,f1109,f1112,f340,f1058]) ).
fof(f1117,plain,
( $false
| spl0_53 ),
inference(forward_subsumption_resolution,[status(thm)],[f1111,f257]) ).
fof(f1118,plain,
spl0_53,
inference(contradiction_clause,[status(thm)],[f1117]) ).
fof(f1308,plain,
( ~ gt(pv10,sk0_23)
| spl0_54 ),
inference(resolution,[status(thm)],[f1114,f118]) ).
fof(f1309,plain,
( $false
| spl0_54 ),
inference(forward_subsumption_resolution,[status(thm)],[f1308,f261]) ).
fof(f1310,plain,
spl0_54,
inference(contradiction_clause,[status(thm)],[f1309]) ).
fof(f1311,plain,
$false,
inference(sat_refutation,[status(thm)],[f346,f1064,f1116,f1118,f1310]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SWV174+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.08/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.30 % Computer : n011.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 30 00:52:31 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.31 % Drodi V3.6.0
% 0.15/0.48 % Refutation found
% 0.15/0.48 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/0.49 % Elapsed time: 0.191435 seconds
% 0.15/0.49 % CPU time: 1.408092 seconds
% 0.15/0.49 % Total memory used: 79.260 MB
% 0.15/0.49 % Net memory used: 77.993 MB
%------------------------------------------------------------------------------