TSTP Solution File: SWV056+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n024.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:52 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 34 ( 16 unt; 0 def)
% Number of atoms : 63 ( 18 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 46 ( 17 ~; 16 |; 8 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 4 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 6 ( 6 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f26,axiom,
! [Body] : sum(n0,tptp_minus_1,Body) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f28,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f39,axiom,
! [X] : minus(X,n1) = pred(X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f40,axiom,
! [X] : pred(succ(X)) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f53,conjecture,
( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f54,negated_conjecture,
~ ( ( leq(n0,pv25)
& leq(pv25,minus(n5,n1)) )
=> ( n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
& leq(n0,pv25)
& leq(pv25,minus(n5,n1)) ) ),
inference(negated_conjecture,[status(cth)],[f53]) ).
fof(f197,plain,
! [X0] : sum(n0,tptp_minus_1,X0) = n0,
inference(cnf_transformation,[status(esa)],[f26]) ).
fof(f199,plain,
succ(tptp_minus_1) = n0,
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f210,plain,
! [X0] : minus(X0,n1) = pred(X0),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f211,plain,
! [X0] : pred(succ(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f40]) ).
fof(f244,plain,
( leq(n0,pv25)
& leq(pv25,minus(n5,n1))
& ( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ) ),
inference(pre_NNF_transformation,[status(esa)],[f54]) ).
fof(f245,plain,
leq(n0,pv25),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f246,plain,
leq(pv25,minus(n5,n1)),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f247,plain,
( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| ~ leq(n0,pv25)
| ~ leq(pv25,minus(n5,n1)) ),
inference(cnf_transformation,[status(esa)],[f244]) ).
fof(f313,plain,
( spl0_0
<=> n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
introduced(split_symbol_definition) ).
fof(f315,plain,
( n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25))
| spl0_0 ),
inference(component_clause,[status(thm)],[f313]) ).
fof(f316,plain,
( spl0_1
<=> leq(n0,pv25) ),
introduced(split_symbol_definition) ).
fof(f318,plain,
( ~ leq(n0,pv25)
| spl0_1 ),
inference(component_clause,[status(thm)],[f316]) ).
fof(f319,plain,
( spl0_2
<=> leq(pv25,minus(n5,n1)) ),
introduced(split_symbol_definition) ).
fof(f321,plain,
( ~ leq(pv25,minus(n5,n1))
| spl0_2 ),
inference(component_clause,[status(thm)],[f319]) ).
fof(f322,plain,
( ~ spl0_0
| ~ spl0_1
| ~ spl0_2 ),
inference(split_clause,[status(thm)],[f247,f313,f316,f319]) ).
fof(f327,plain,
leq(pv25,pred(n5)),
inference(backward_demodulation,[status(thm)],[f210,f246]) ).
fof(f389,plain,
pred(n0) = tptp_minus_1,
inference(paramodulation,[status(thm)],[f199,f211]) ).
fof(f408,plain,
( ~ leq(pv25,pred(n5))
| spl0_2 ),
inference(forward_demodulation,[status(thm)],[f210,f321]) ).
fof(f409,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f408,f327]) ).
fof(f410,plain,
spl0_2,
inference(contradiction_clause,[status(thm)],[f409]) ).
fof(f411,plain,
( n0 != sum(n0,pred(n0),a_select3(q,pv77,pv25))
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f210,f315]) ).
fof(f554,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f318,f245]) ).
fof(f555,plain,
spl0_1,
inference(contradiction_clause,[status(thm)],[f554]) ).
fof(f698,plain,
( n0 != sum(n0,tptp_minus_1,a_select3(q,pv77,pv25))
| spl0_0 ),
inference(backward_demodulation,[status(thm)],[f389,f411]) ).
fof(f699,plain,
( n0 != n0
| spl0_0 ),
inference(forward_demodulation,[status(thm)],[f197,f698]) ).
fof(f700,plain,
( $false
| spl0_0 ),
inference(trivial_equality_resolution,[status(esa)],[f699]) ).
fof(f701,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f700]) ).
fof(f702,plain,
$false,
inference(sat_refutation,[status(thm)],[f322,f410,f555,f701]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV056+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 30 00:36:06 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.38 % Elapsed time: 0.028180 seconds
% 0.13/0.38 % CPU time: 0.065602 seconds
% 0.13/0.38 % Total memory used: 16.537 MB
% 0.13/0.38 % Net memory used: 16.470 MB
%------------------------------------------------------------------------------