TSTP Solution File: SWV007-1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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:45 EDT 2024
% Result : Unsatisfiable 0.14s 0.31s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 16
% Syntax : Number of formulae : 56 ( 16 unt; 0 def)
% Number of atoms : 109 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 100 ( 47 ~; 47 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 7 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 28 ( 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X] : predecessor(successor(X)) = X,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X] : less_than(predecessor(X),X),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] : less_than(X,successor(X)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Z,Y] :
( less_than(X,Z)
| ~ less_than(X,Y)
| ~ less_than(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [X,Y] :
( less_than(X,Y)
| less_than(Y,X)
| X = Y ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,Y] :
( ~ less_than(X,Y)
| ~ less_than(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ less_than(n,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,negated_conjecture,
less_than(i,m),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f20,negated_conjecture,
less_than(a(m),a(k)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f23,negated_conjecture,
! [X] :
( less_than(X,i)
| ~ less_than(X,successor(n))
| ~ less_than(a(X),a(k)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f24,plain,
! [X0] : predecessor(successor(X0)) = X0,
inference(cnf_transformation,[status(esa)],[f1]) ).
fof(f28,plain,
! [X0] : less_than(predecessor(X0),X0),
inference(cnf_transformation,[status(esa)],[f5]) ).
fof(f29,plain,
! [X0] : less_than(X0,successor(X0)),
inference(cnf_transformation,[status(esa)],[f6]) ).
fof(f30,plain,
! [Z,Y] :
( ! [X] :
( less_than(X,Z)
| ~ less_than(X,Y) )
| ~ less_than(Y,Z) ),
inference(miniscoping,[status(esa)],[f7]) ).
fof(f31,plain,
! [X0,X1,X2] :
( less_than(X0,X1)
| ~ less_than(X0,X2)
| ~ less_than(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( less_than(X0,X1)
| less_than(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f34,plain,
! [X0,X1] :
( ~ less_than(X0,X1)
| ~ less_than(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f42,plain,
~ less_than(n,m),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f43,plain,
less_than(i,m),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f46,plain,
less_than(a(m),a(k)),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f49,plain,
! [X0] :
( less_than(X0,i)
| ~ less_than(X0,successor(n))
| ~ less_than(a(X0),a(k)) ),
inference(cnf_transformation,[status(esa)],[f23]) ).
fof(f65,plain,
~ less_than(m,i),
inference(resolution,[status(thm)],[f34,f43]) ).
fof(f67,plain,
! [X0] : ~ less_than(successor(X0),X0),
inference(resolution,[status(thm)],[f34,f29]) ).
fof(f68,plain,
! [X0,X1] :
( less_than(predecessor(X0),X1)
| ~ less_than(X0,X1) ),
inference(resolution,[status(thm)],[f31,f28]) ).
fof(f88,plain,
( spl0_4
<=> less_than(m,n) ),
introduced(split_symbol_definition) ).
fof(f89,plain,
( less_than(m,n)
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f88]) ).
fof(f91,plain,
( spl0_5
<=> n = m ),
introduced(split_symbol_definition) ).
fof(f92,plain,
( n = m
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f91]) ).
fof(f94,plain,
( less_than(m,n)
| n = m ),
inference(resolution,[status(thm)],[f32,f42]) ).
fof(f95,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f94,f88,f91]) ).
fof(f208,plain,
( spl0_20
<=> less_than(m,i) ),
introduced(split_symbol_definition) ).
fof(f209,plain,
( less_than(m,i)
| ~ spl0_20 ),
inference(component_clause,[status(thm)],[f208]) ).
fof(f211,plain,
( spl0_21
<=> less_than(m,successor(n)) ),
introduced(split_symbol_definition) ).
fof(f213,plain,
( ~ less_than(m,successor(n))
| spl0_21 ),
inference(component_clause,[status(thm)],[f211]) ).
fof(f214,plain,
( less_than(m,i)
| ~ less_than(m,successor(n)) ),
inference(resolution,[status(thm)],[f49,f46]) ).
fof(f215,plain,
( spl0_20
| ~ spl0_21 ),
inference(split_clause,[status(thm)],[f214,f208,f211]) ).
fof(f255,plain,
( $false
| ~ spl0_20 ),
inference(forward_subsumption_resolution,[status(thm)],[f209,f65]) ).
fof(f256,plain,
~ spl0_20,
inference(contradiction_clause,[status(thm)],[f255]) ).
fof(f257,plain,
( spl0_27
<=> less_than(successor(n),m) ),
introduced(split_symbol_definition) ).
fof(f258,plain,
( less_than(successor(n),m)
| ~ spl0_27 ),
inference(component_clause,[status(thm)],[f257]) ).
fof(f260,plain,
( spl0_28
<=> successor(n) = m ),
introduced(split_symbol_definition) ).
fof(f261,plain,
( successor(n) = m
| ~ spl0_28 ),
inference(component_clause,[status(thm)],[f260]) ).
fof(f263,plain,
( less_than(successor(n),m)
| successor(n) = m
| spl0_21 ),
inference(resolution,[status(thm)],[f213,f32]) ).
fof(f264,plain,
( spl0_27
| spl0_28
| spl0_21 ),
inference(split_clause,[status(thm)],[f263,f257,f260,f211]) ).
fof(f292,plain,
( ~ less_than(m,n)
| ~ spl0_28 ),
inference(paramodulation,[status(thm)],[f261,f67]) ).
fof(f293,plain,
( $false
| ~ spl0_4
| ~ spl0_28 ),
inference(forward_subsumption_resolution,[status(thm)],[f292,f89]) ).
fof(f294,plain,
( ~ spl0_4
| ~ spl0_28 ),
inference(contradiction_clause,[status(thm)],[f293]) ).
fof(f319,plain,
( ~ less_than(n,m)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f89,f34]) ).
fof(f335,plain,
( less_than(predecessor(successor(n)),m)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f258,f68]) ).
fof(f336,plain,
( less_than(n,m)
| ~ spl0_27 ),
inference(forward_demodulation,[status(thm)],[f24,f335]) ).
fof(f337,plain,
( $false
| ~ spl0_4
| ~ spl0_27 ),
inference(forward_subsumption_resolution,[status(thm)],[f336,f319]) ).
fof(f338,plain,
( ~ spl0_4
| ~ spl0_27 ),
inference(contradiction_clause,[status(thm)],[f337]) ).
fof(f343,plain,
( ~ less_than(n,successor(n))
| ~ spl0_5
| spl0_21 ),
inference(backward_demodulation,[status(thm)],[f92,f213]) ).
fof(f344,plain,
( $false
| ~ spl0_5
| spl0_21 ),
inference(forward_subsumption_resolution,[status(thm)],[f343,f29]) ).
fof(f345,plain,
( ~ spl0_5
| spl0_21 ),
inference(contradiction_clause,[status(thm)],[f344]) ).
fof(f346,plain,
$false,
inference(sat_refutation,[status(thm)],[f95,f215,f256,f264,f294,f338,f345]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWV007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.30 % Computer : n008.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 00:47:57 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.10/0.31 % Drodi V3.6.0
% 0.14/0.31 % Refutation found
% 0.14/0.31 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/0.31 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.33 % Elapsed time: 0.020063 seconds
% 0.14/0.33 % CPU time: 0.039869 seconds
% 0.14/0.33 % Total memory used: 13.264 MB
% 0.14/0.33 % Net memory used: 13.217 MB
%------------------------------------------------------------------------------