TSTP Solution File: SWV065+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SWV065+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n029.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:34 EDT 2023
% Result : Theorem 0.10s 0.34s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 12 unt; 0 def)
% Number of atoms : 79 ( 0 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 68 ( 21 ~; 22 |; 18 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 2 (; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f99,plain,
! [X0] : leq(X0,X0),
inference(cnf_transformation,[status(esa)],[f4]) ).
fof(f251,plain,
( leq(n0,pv10)
& leq(n0,pv53)
& leq(pv10,minus(n135300,n1))
& leq(pv53,minus(n5,n1))
& ( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f252,plain,
leq(n0,pv10),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f253,plain,
leq(n0,pv53),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f254,plain,
leq(pv10,minus(n135300,n1)),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f255,plain,
leq(pv53,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f256,plain,
( ~ leq(n0,n0)
| ~ leq(n0,pv10)
| ~ leq(n0,pv53)
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(pv53,minus(n5,n1)) ),
inference(cnf_transformation,[status(esa)],[f251]) ).
fof(f329,plain,
( spl0_0
<=> leq(n0,n0) ),
introduced(split_symbol_definition) ).
fof(f331,plain,
( ~ leq(n0,n0)
| spl0_0 ),
inference(component_clause,[status(thm)],[f329]) ).
fof(f332,plain,
( spl0_1
<=> leq(n0,pv10) ),
introduced(split_symbol_definition) ).
fof(f334,plain,
( ~ leq(n0,pv10)
| spl0_1 ),
inference(component_clause,[status(thm)],[f332]) ).
fof(f335,plain,
( spl0_2
<=> leq(n0,pv53) ),
introduced(split_symbol_definition) ).
fof(f337,plain,
( ~ leq(n0,pv53)
| spl0_2 ),
inference(component_clause,[status(thm)],[f335]) ).
fof(f338,plain,
( spl0_3
<=> leq(pv10,minus(n135300,n1)) ),
introduced(split_symbol_definition) ).
fof(f340,plain,
( ~ leq(pv10,minus(n135300,n1))
| spl0_3 ),
inference(component_clause,[status(thm)],[f338]) ).
fof(f341,plain,
( spl0_4
<=> leq(pv53,minus(n5,n1)) ),
introduced(split_symbol_definition) ).
fof(f343,plain,
( ~ leq(pv53,minus(n5,n1))
| spl0_4 ),
inference(component_clause,[status(thm)],[f341]) ).
fof(f344,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f256,f329,f332,f335,f338,f341]) ).
fof(f352,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f343,f255]) ).
fof(f353,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f352]) ).
fof(f354,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f340,f254]) ).
fof(f355,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f354]) ).
fof(f356,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f337,f253]) ).
fof(f357,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f356]) ).
fof(f358,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f331,f99]) ).
fof(f359,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f358]) ).
fof(f360,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f334,f252]) ).
fof(f361,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f360]) ).
fof(f362,plain,
$false,
inference(sat_refutation,[status(thm)],[f344,f353,f355,f357,f359,f361]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SWV065+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.05/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.32 % Computer : n029.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:54:51 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.10/0.33 % Drodi V3.5.1
% 0.10/0.34 % Refutation found
% 0.10/0.34 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.10/0.34 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.16/0.58 % Elapsed time: 0.039757 seconds
% 0.16/0.58 % CPU time: 0.018743 seconds
% 0.16/0.58 % Memory used: 4.006 MB
%------------------------------------------------------------------------------