TSTP Solution File: FLD067-2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n012.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:07:08 EDT 2023
% Result : Unsatisfiable 28.63s 4.08s
% Output : CNFRefutation 29.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 22
% Syntax : Number of formulae : 76 ( 23 unt; 0 def)
% Number of atoms : 151 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 141 ( 66 ~; 68 |; 0 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 57 (; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f11,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,axiom,
! [X] :
( defined(additive_inverse(X))
| ~ defined(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f14,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f17,axiom,
! [X,Z,Y] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,Z) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f18,axiom,
! [X,Y] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X)
| ~ defined(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f19,axiom,
! [X,Z,Y] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f26,axiom,
! [Y,Z,X] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f28,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f29,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f30,hypothesis,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f31,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f32,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
~ less_or_equal(additive_identity,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f37,plain,
! [X0] :
( equalish(add(X0,additive_inverse(X0)),additive_identity)
| ~ defined(X0) ),
inference(cnf_transformation,[status(esa)],[f3]) ).
fof(f50,plain,
defined(additive_identity),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f51,plain,
! [X0] :
( defined(additive_inverse(X0))
| ~ defined(X0) ),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f54,plain,
defined(multiplicative_identity),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f57,plain,
! [Z,Y] :
( ! [X] :
( less_or_equal(X,Z)
| ~ less_or_equal(X,Y) )
| ~ less_or_equal(Y,Z) ),
inference(miniscoping,[status(esa)],[f17]) ).
fof(f58,plain,
! [X0,X1,X2] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X0,X2)
| ~ less_or_equal(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f57]) ).
fof(f59,plain,
! [Y] :
( ! [X] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X) )
| ~ defined(Y) ),
inference(miniscoping,[status(esa)],[f18]) ).
fof(f60,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| less_or_equal(X1,X0)
| ~ defined(X0)
| ~ defined(X1) ),
inference(cnf_transformation,[status(esa)],[f59]) ).
fof(f61,plain,
! [X,Y] :
( ! [Z] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z) )
| ~ less_or_equal(X,Y) ),
inference(miniscoping,[status(esa)],[f19]) ).
fof(f62,plain,
! [X0,X1,X2] :
( less_or_equal(add(X0,X1),add(X2,X1))
| ~ defined(X1)
| ~ less_or_equal(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f66,plain,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f73,plain,
! [Y,X] :
( ! [Z] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z) )
| ~ equalish(X,Y) ),
inference(miniscoping,[status(esa)],[f26]) ).
fof(f74,plain,
! [X0,X1,X2] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ equalish(X2,X0) ),
inference(cnf_transformation,[status(esa)],[f73]) ).
fof(f76,plain,
defined(a),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f77,plain,
defined(b),
inference(cnf_transformation,[status(esa)],[f29]) ).
fof(f78,plain,
defined(u),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f79,plain,
less_or_equal(a,b),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f80,plain,
equalish(add(b,additive_inverse(a)),u),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f81,plain,
~ less_or_equal(additive_identity,u),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f83,plain,
! [X0] :
( less_or_equal(X0,b)
| ~ less_or_equal(X0,a) ),
inference(resolution,[status(thm)],[f58,f79]) ).
fof(f104,plain,
( spl0_3
<=> defined(multiplicative_identity) ),
introduced(split_symbol_definition) ).
fof(f106,plain,
( ~ defined(multiplicative_identity)
| spl0_3 ),
inference(component_clause,[status(thm)],[f104]) ).
fof(f115,plain,
( spl0_5
<=> defined(additive_identity) ),
introduced(split_symbol_definition) ).
fof(f117,plain,
( ~ defined(additive_identity)
| spl0_5 ),
inference(component_clause,[status(thm)],[f115]) ).
fof(f139,plain,
( spl0_9
<=> less_or_equal(a,b) ),
introduced(split_symbol_definition) ).
fof(f157,plain,
( spl0_12
<=> defined(b) ),
introduced(split_symbol_definition) ).
fof(f159,plain,
( ~ defined(b)
| spl0_12 ),
inference(component_clause,[status(thm)],[f157]) ).
fof(f165,plain,
( spl0_14
<=> defined(u) ),
introduced(split_symbol_definition) ).
fof(f167,plain,
( ~ defined(u)
| spl0_14 ),
inference(component_clause,[status(thm)],[f165]) ).
fof(f170,plain,
( spl0_15
<=> defined(a) ),
introduced(split_symbol_definition) ).
fof(f172,plain,
( ~ defined(a)
| spl0_15 ),
inference(component_clause,[status(thm)],[f170]) ).
fof(f176,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0)
| ~ defined(X0)
| less_or_equal(X0,X0) ),
inference(resolution,[status(thm)],[f60,f58]) ).
fof(f177,plain,
! [X0] :
( less_or_equal(X0,X0)
| ~ defined(X0) ),
inference(duplicate_literals_removal,[status(esa)],[f176]) ).
fof(f182,plain,
( $false
| spl0_15 ),
inference(forward_subsumption_resolution,[status(thm)],[f172,f76]) ).
fof(f183,plain,
spl0_15,
inference(contradiction_clause,[status(thm)],[f182]) ).
fof(f184,plain,
( $false
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f159,f77]) ).
fof(f185,plain,
spl0_12,
inference(contradiction_clause,[status(thm)],[f184]) ).
fof(f186,plain,
( $false
| spl0_14 ),
inference(forward_subsumption_resolution,[status(thm)],[f167,f78]) ).
fof(f187,plain,
spl0_14,
inference(contradiction_clause,[status(thm)],[f186]) ).
fof(f188,plain,
( $false
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f117,f50]) ).
fof(f189,plain,
spl0_5,
inference(contradiction_clause,[status(thm)],[f188]) ).
fof(f192,plain,
( ~ defined(a)
| less_or_equal(a,b) ),
inference(resolution,[status(thm)],[f177,f83]) ).
fof(f193,plain,
( ~ spl0_15
| spl0_9 ),
inference(split_clause,[status(thm)],[f192,f170,f139]) ).
fof(f194,plain,
! [X0,X1] :
( ~ defined(X0)
| less_or_equal(X1,X0)
| ~ equalish(X0,X1) ),
inference(resolution,[status(thm)],[f177,f74]) ).
fof(f233,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f106,f54]) ).
fof(f234,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f233]) ).
fof(f526,plain,
! [X0] :
( less_or_equal(X0,u)
| ~ equalish(u,X0) ),
inference(resolution,[status(thm)],[f194,f78]) ).
fof(f533,plain,
! [X0] :
( less_or_equal(X0,u)
| ~ equalish(X0,u) ),
inference(resolution,[status(thm)],[f526,f66]) ).
fof(f578,plain,
! [X0,X1] :
( ~ equalish(X0,u)
| less_or_equal(X1,u)
| ~ less_or_equal(X1,X0) ),
inference(resolution,[status(thm)],[f533,f58]) ).
fof(f1121,plain,
! [X0,X1,X2] :
( ~ equalish(X0,u)
| ~ less_or_equal(X1,X0)
| less_or_equal(X2,u)
| ~ equalish(X1,X2) ),
inference(resolution,[status(thm)],[f578,f74]) ).
fof(f1355,plain,
( spl0_126
<=> defined(additive_inverse(a)) ),
introduced(split_symbol_definition) ).
fof(f1357,plain,
( ~ defined(additive_inverse(a))
| spl0_126 ),
inference(component_clause,[status(thm)],[f1355]) ).
fof(f1522,plain,
( ~ defined(a)
| spl0_126 ),
inference(resolution,[status(thm)],[f1357,f51]) ).
fof(f1523,plain,
( ~ spl0_15
| spl0_126 ),
inference(split_clause,[status(thm)],[f1522,f170,f1355]) ).
fof(f2758,plain,
! [X0,X1] :
( ~ less_or_equal(X0,add(b,additive_inverse(a)))
| less_or_equal(X1,u)
| ~ equalish(X0,X1) ),
inference(resolution,[status(thm)],[f1121,f80]) ).
fof(f5177,plain,
! [X0] :
( ~ less_or_equal(X0,add(b,additive_inverse(a)))
| ~ equalish(X0,additive_identity) ),
inference(resolution,[status(thm)],[f2758,f81]) ).
fof(f5201,plain,
! [X0] :
( ~ less_or_equal(add(X0,additive_inverse(X0)),add(b,additive_inverse(a)))
| ~ defined(X0) ),
inference(resolution,[status(thm)],[f5177,f37]) ).
fof(f5220,plain,
~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))),
inference(resolution,[status(thm)],[f5201,f76]) ).
fof(f5443,plain,
( ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b) ),
inference(resolution,[status(thm)],[f5220,f62]) ).
fof(f5444,plain,
( ~ spl0_126
| ~ spl0_9 ),
inference(split_clause,[status(thm)],[f5443,f1355,f139]) ).
fof(f5513,plain,
$false,
inference(sat_refutation,[status(thm)],[f183,f185,f187,f189,f193,f234,f1523,f5444]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : FLD067-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.04/0.09 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Tue May 30 10:56:40 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.09/0.30 % Drodi V3.5.1
% 28.63/4.08 % Refutation found
% 28.63/4.08 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 28.63/4.08 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 29.06/4.12 % Elapsed time: 3.811233 seconds
% 29.06/4.12 % CPU time: 29.289734 seconds
% 29.06/4.12 % Memory used: 88.534 MB
%------------------------------------------------------------------------------