TSTP Solution File: SWV174+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% 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 : n004.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:50 EDT 2023
% Result : Theorem 1.83s 0.65s
% Output : CNFRefutation 1.83s
% 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(f383,plain,
( spl0_0
<=> leq(n0,sk0_23) ),
introduced(split_symbol_definition) ).
fof(f385,plain,
( ~ leq(n0,sk0_23)
| spl0_0 ),
inference(component_clause,[status(thm)],[f383]) ).
fof(f386,plain,
( spl0_1
<=> leq(sk0_23,pred(pv10)) ),
introduced(split_symbol_definition) ).
fof(f388,plain,
( ~ leq(sk0_23,pred(pv10))
| spl0_1 ),
inference(component_clause,[status(thm)],[f386]) ).
fof(f389,plain,
( spl0_2
<=> leq(n0,sk0_24) ),
introduced(split_symbol_definition) ).
fof(f391,plain,
( ~ leq(n0,sk0_24)
| spl0_2 ),
inference(component_clause,[status(thm)],[f389]) ).
fof(f392,plain,
( spl0_3
<=> leq(sk0_24,n4) ),
introduced(split_symbol_definition) ).
fof(f394,plain,
( ~ leq(sk0_24,n4)
| spl0_3 ),
inference(component_clause,[status(thm)],[f392]) ).
fof(f395,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(f396,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f395,f383,f386,f389,f392]) ).
fof(f397,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f394,f260]) ).
fof(f398,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f397]) ).
fof(f399,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f391,f258]) ).
fof(f400,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f399]) ).
fof(f401,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f385,f257]) ).
fof(f402,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f401]) ).
fof(f3966,plain,
( ~ gt(pv10,sk0_23)
| spl0_1 ),
inference(resolution,[status(thm)],[f388,f118]) ).
fof(f4123,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f261,f3966]) ).
fof(f4124,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f4123]) ).
fof(f4125,plain,
$false,
inference(sat_refutation,[status(thm)],[f396,f398,f400,f402,f4124]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWV174+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n004.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue May 30 11:36:22 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 1.83/0.65 % Refutation found
% 1.83/0.65 % SZS status Theorem for theBenchmark: Theorem is valid
% 1.83/0.65 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.83/0.67 % Elapsed time: 0.347895 seconds
% 1.83/0.67 % CPU time: 1.979237 seconds
% 1.83/0.67 % Memory used: 76.400 MB
%------------------------------------------------------------------------------