TSTP Solution File: SWV078+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV078+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:55 EDT 2024
% Result : Theorem 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 32 ( 11 unt; 0 def)
% Number of atoms : 77 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 27 ~; 19 |; 15 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 2 ( 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f51,axiom,
true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) )
=> ( ( n0 != pv70
=> ( leq(n0,pv31)
& leq(pv31,minus(n5,n1)) ) )
& ( n0 = pv70
=> true ) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f210,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f242,plain,
true,
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f244,plain,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( ( n0 != pv70
& ( ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) )
| ( n0 = pv70
& ~ true ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
( pd0_3
=> ( n0 != pv70
& ( ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) ) ),
introduced(predicate_definition,[f244]) ).
fof(f246,plain,
( leq(n0,pv31)
& leq(pv31,minus(n5,n1))
& ( pd0_3
| ( n0 = pv70
& ~ true ) ) ),
inference(formula_renaming,[status(thm)],[f244,f245]) ).
fof(f247,plain,
leq(n0,pv31),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f248,plain,
leq(pv31,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f250,plain,
( pd0_3
| ~ true ),
inference(cnf_transformation,[status(esa)],[f246]) ).
fof(f310,plain,
( ~ pd0_3
| ( n0 != pv70
& ( ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f245]) ).
fof(f312,plain,
( ~ pd0_3
| ~ leq(n0,pv31)
| ~ leq(pv31,minus(n5,n1)) ),
inference(cnf_transformation,[status(esa)],[f310]) ).
fof(f319,plain,
( spl0_0
<=> pd0_3 ),
introduced(split_symbol_definition) ).
fof(f326,plain,
( spl0_2
<=> true ),
introduced(split_symbol_definition) ).
fof(f328,plain,
( ~ true
| spl0_2 ),
inference(component_clause,[status(thm)],[f326]) ).
fof(f329,plain,
( spl0_0
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f250,f319,f326]) ).
fof(f331,plain,
( spl0_3
<=> leq(n0,pv31) ),
introduced(split_symbol_definition) ).
fof(f333,plain,
( ~ leq(n0,pv31)
| spl0_3 ),
inference(component_clause,[status(thm)],[f331]) ).
fof(f334,plain,
( spl0_4
<=> leq(pv31,minus(n5,n1)) ),
introduced(split_symbol_definition) ).
fof(f336,plain,
( ~ leq(pv31,minus(n5,n1))
| spl0_4 ),
inference(component_clause,[status(thm)],[f334]) ).
fof(f337,plain,
( ~ spl0_0
| ~ spl0_3
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f312,f319,f331,f334]) ).
fof(f342,plain,
leq(pv31,pred(n5)),
inference(backward_demodulation,[status(thm)],[f210,f248]) ).
fof(f353,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f333,f247]) ).
fof(f354,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f353]) ).
fof(f355,plain,
( ~ leq(pv31,pred(n5))
| spl0_4 ),
inference(forward_demodulation,[status(thm)],[f210,f336]) ).
fof(f356,plain,
( $false
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f355,f342]) ).
fof(f357,plain,
spl0_4,
inference(contradiction_clause,[status(thm)],[f356]) ).
fof(f358,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f328,f242]) ).
fof(f359,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f358]) ).
fof(f360,plain,
$false,
inference(sat_refutation,[status(thm)],[f329,f337,f354,f357,f359]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SWV078+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.10 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.08/0.29 % Computer : n009.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Tue Apr 30 00:52:40 EDT 2024
% 0.08/0.30 % CPUTime :
% 0.14/0.31 % Drodi V3.6.0
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.33 % Elapsed time: 0.019314 seconds
% 0.14/0.33 % CPU time: 0.028085 seconds
% 0.14/0.33 % Total memory used: 14.103 MB
% 0.14/0.33 % Net memory used: 14.084 MB
%------------------------------------------------------------------------------