TSTP Solution File: SWV007-1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% 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 : n006.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:27 EDT 2023
% Result : Unsatisfiable 0.16s 0.32s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 50 ( 13 unt; 0 def)
% Number of atoms : 101 ( 8 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 94 ( 43 ~; 45 |; 0 &)
% ( 6 <=>; 0 =>; 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 : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 23 (; 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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
<=> m = n ),
introduced(split_symbol_definition) ).
fof(f92,plain,
( m = n
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f91]) ).
fof(f94,plain,
( less_than(m,n)
| m = n ),
inference(resolution,[status(thm)],[f32,f42]) ).
fof(f95,plain,
( spl0_4
| spl0_5 ),
inference(split_clause,[status(thm)],[f94,f88,f91]) ).
fof(f151,plain,
( spl0_12
<=> less_than(m,i) ),
introduced(split_symbol_definition) ).
fof(f152,plain,
( less_than(m,i)
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f151]) ).
fof(f154,plain,
( spl0_13
<=> less_than(m,successor(n)) ),
introduced(split_symbol_definition) ).
fof(f156,plain,
( ~ less_than(m,successor(n))
| spl0_13 ),
inference(component_clause,[status(thm)],[f154]) ).
fof(f157,plain,
( less_than(m,i)
| ~ less_than(m,successor(n)) ),
inference(resolution,[status(thm)],[f49,f46]) ).
fof(f158,plain,
( spl0_12
| ~ spl0_13 ),
inference(split_clause,[status(thm)],[f157,f151,f154]) ).
fof(f162,plain,
! [X0] :
( less_than(X0,n)
| ~ less_than(X0,m)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f89,f31]) ).
fof(f168,plain,
( spl0_14
<=> less_than(successor(n),m) ),
introduced(split_symbol_definition) ).
fof(f169,plain,
( less_than(successor(n),m)
| ~ spl0_14 ),
inference(component_clause,[status(thm)],[f168]) ).
fof(f171,plain,
( spl0_15
<=> successor(n) = m ),
introduced(split_symbol_definition) ).
fof(f172,plain,
( successor(n) = m
| ~ spl0_15 ),
inference(component_clause,[status(thm)],[f171]) ).
fof(f174,plain,
( less_than(successor(n),m)
| successor(n) = m
| spl0_13 ),
inference(resolution,[status(thm)],[f156,f32]) ).
fof(f175,plain,
( spl0_14
| spl0_15
| spl0_13 ),
inference(split_clause,[status(thm)],[f174,f168,f171,f154]) ).
fof(f176,plain,
( $false
| ~ spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f152,f65]) ).
fof(f177,plain,
~ spl0_12,
inference(contradiction_clause,[status(thm)],[f176]) ).
fof(f250,plain,
( less_than(successor(n),n)
| ~ spl0_4
| ~ spl0_14 ),
inference(resolution,[status(thm)],[f162,f169]) ).
fof(f251,plain,
( $false
| ~ spl0_4
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f250,f67]) ).
fof(f252,plain,
( ~ spl0_4
| ~ spl0_14 ),
inference(contradiction_clause,[status(thm)],[f251]) ).
fof(f268,plain,
( less_than(n,m)
| ~ spl0_15 ),
inference(paramodulation,[status(thm)],[f172,f29]) ).
fof(f269,plain,
( $false
| ~ spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f268,f42]) ).
fof(f270,plain,
~ spl0_15,
inference(contradiction_clause,[status(thm)],[f269]) ).
fof(f307,plain,
( ~ less_than(n,successor(n))
| ~ spl0_5
| spl0_13 ),
inference(forward_demodulation,[status(thm)],[f92,f156]) ).
fof(f308,plain,
( $false
| ~ spl0_5
| spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f307,f29]) ).
fof(f309,plain,
( ~ spl0_5
| spl0_13 ),
inference(contradiction_clause,[status(thm)],[f308]) ).
fof(f310,plain,
$false,
inference(sat_refutation,[status(thm)],[f95,f158,f175,f177,f252,f270,f309]) ).
%------------------------------------------------------------------------------
%----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.11/0.31 % Computer : n006.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue May 30 11:36:47 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.16/0.31 % Drodi V3.5.1
% 0.16/0.32 % Refutation found
% 0.16/0.32 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.16/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.54 % Elapsed time: 0.013044 seconds
% 0.17/0.54 % CPU time: 0.016161 seconds
% 0.17/0.54 % Memory used: 3.758 MB
%------------------------------------------------------------------------------