TSTP Solution File: SWV069+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV069+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:45:54 EDT 2024
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 131 ( 8 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 114 ( 44 ~; 45 |; 13 &)
% ( 8 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
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(f10,axiom,
! [X,Y] :
( leq(X,pred(Y))
<=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f66,axiom,
gt(n5,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f98,plain,
! [X0] : ~ gt(X0,X0),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f99,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
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(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(f217,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f251,plain,
( leq(n0,pv10)
& leq(pv10,minus(n135300,n1))
& ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f253,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f254,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1)) ),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f266,plain,
gt(n5,n0),
inference(cnf_transformation,[status(esa)],[f66]) ).
fof(f327,plain,
( spl0_0
<=> leq(n0,n0) ),
introduced(split_symbol_definition) ).
fof(f329,plain,
( ~ leq(n0,n0)
| spl0_0 ),
inference(component_clause,[status(thm)],[f327]) ).
fof(f330,plain,
( spl0_1
<=> leq(n0,pv10) ),
introduced(split_symbol_definition) ).
fof(f332,plain,
( ~ leq(n0,pv10)
| spl0_1 ),
inference(component_clause,[status(thm)],[f330]) ).
fof(f333,plain,
( spl0_2
<=> leq(n0,minus(n5,n1)) ),
introduced(split_symbol_definition) ).
fof(f335,plain,
( ~ leq(n0,minus(n5,n1))
| spl0_2 ),
inference(component_clause,[status(thm)],[f333]) ).
fof(f336,plain,
( spl0_3
<=> leq(pv10,minus(n135300,n1)) ),
introduced(split_symbol_definition) ).
fof(f338,plain,
( ~ leq(pv10,minus(n135300,n1))
| spl0_3 ),
inference(component_clause,[status(thm)],[f336]) ).
fof(f339,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f254,f327,f330,f333,f336]) ).
fof(f342,plain,
leq(pv10,pred(n135300)),
inference(backward_demodulation,[status(thm)],[f217,f253]) ).
fof(f356,plain,
( ~ leq(pv10,pred(n135300))
| spl0_3 ),
inference(forward_demodulation,[status(thm)],[f217,f338]) ).
fof(f449,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f342,f356]) ).
fof(f450,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f449]) ).
fof(f451,plain,
( ~ leq(n0,pred(n5))
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f217,f335]) ).
fof(f457,plain,
( spl0_8
<=> leq(n0,n5) ),
introduced(split_symbol_definition) ).
fof(f458,plain,
( leq(n0,n5)
| ~ spl0_8 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f459,plain,
( ~ leq(n0,n5)
| spl0_8 ),
inference(component_clause,[status(thm)],[f457]) ).
fof(f460,plain,
( spl0_9
<=> n5 = n0 ),
introduced(split_symbol_definition) ).
fof(f461,plain,
( n5 = n0
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f460]) ).
fof(f486,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f329,f99]) ).
fof(f487,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f486]) ).
fof(f488,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f332,f252]) ).
fof(f489,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f488]) ).
fof(f607,plain,
( ~ gt(n5,n0)
| spl0_8 ),
inference(resolution,[status(thm)],[f459,f112]) ).
fof(f608,plain,
( $false
| spl0_8 ),
inference(forward_subsumption_resolution,[status(thm)],[f607,f266]) ).
fof(f609,plain,
spl0_8,
inference(contradiction_clause,[status(thm)],[f608]) ).
fof(f619,plain,
( spl0_23
<=> gt(n5,n0) ),
introduced(split_symbol_definition) ).
fof(f620,plain,
( gt(n5,n0)
| ~ spl0_23 ),
inference(component_clause,[status(thm)],[f619]) ).
fof(f622,plain,
( n0 = n5
| gt(n5,n0)
| ~ spl0_8 ),
inference(resolution,[status(thm)],[f458,f114]) ).
fof(f623,plain,
( spl0_9
| spl0_23
| ~ spl0_8 ),
inference(split_clause,[status(thm)],[f622,f460,f619,f457]) ).
fof(f628,plain,
( gt(n0,n0)
| ~ spl0_9 ),
inference(backward_demodulation,[status(thm)],[f461,f266]) ).
fof(f629,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f628,f98]) ).
fof(f630,plain,
~ spl0_9,
inference(contradiction_clause,[status(thm)],[f629]) ).
fof(f640,plain,
( ~ gt(n5,n0)
| spl0_2 ),
inference(resolution,[status(thm)],[f451,f118]) ).
fof(f648,plain,
( $false
| ~ spl0_23
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f640,f620]) ).
fof(f649,plain,
( ~ spl0_23
| spl0_2 ),
inference(contradiction_clause,[status(thm)],[f648]) ).
fof(f650,plain,
$false,
inference(sat_refutation,[status(thm)],[f339,f450,f487,f489,f609,f623,f630,f649]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV069+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 30 00:56:01 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.38 % Drodi V3.6.0
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.42 % Elapsed time: 0.055282 seconds
% 0.20/0.42 % CPU time: 0.203954 seconds
% 0.20/0.42 % Total memory used: 39.629 MB
% 0.20/0.42 % Net memory used: 39.500 MB
%------------------------------------------------------------------------------