TSTP Solution File: FLD070-2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : FLD070-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n027.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:16:36 EDT 2024
% Result : Unsatisfiable 49.68s 6.62s
% Output : CNFRefutation 49.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 26
% Syntax : Number of formulae : 98 ( 26 unt; 0 def)
% Number of atoms : 201 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 191 ( 88 ~; 94 |; 0 &)
% ( 9 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 69 ( 69 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X] :
( equalish(add(additive_identity,X),X)
| ~ defined(X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,Y] :
( equalish(add(X,Y),add(Y,X))
| ~ defined(X)
| ~ defined(Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f14,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ less_or_equal(X,Y)
| ~ less_or_equal(Y,X) ),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f22,axiom,
! [X,Y] :
( equalish(X,Y)
| ~ equalish(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f23,axiom,
! [X,Z,Y] :
( equalish(X,Z)
| ~ equalish(X,Y)
| ~ equalish(Y,Z) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p') ).
fof(f28,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f29,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f30,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f31,negated_conjecture,
equalish(add(a,b),c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f32,negated_conjecture,
less_or_equal(additive_identity,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,negated_conjecture,
less_or_equal(additive_identity,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f34,negated_conjecture,
~ less_or_equal(additive_identity,c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f37,plain,
! [X0] :
( equalish(add(additive_identity,X0),X0)
| ~ defined(X0) ),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f39,plain,
! [Y] :
( ! [X] :
( equalish(add(X,Y),add(Y,X))
| ~ defined(X) )
| ~ defined(Y) ),
inference(miniscoping,[status(esa)],[f4]) ).
fof(f40,plain,
! [X0,X1] :
( equalish(add(X0,X1),add(X1,X0))
| ~ defined(X0)
| ~ defined(X1) ),
inference(cnf_transformation,[status(esa)],[f39]) ).
fof(f55,plain,
defined(multiplicative_identity),
inference(cnf_transformation,[status(esa)],[f14]) ).
fof(f57,plain,
! [X0,X1] :
( equalish(X0,X1)
| ~ less_or_equal(X0,X1)
| ~ less_or_equal(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f58,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(f59,plain,
! [X0,X1,X2] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X0,X2)
| ~ less_or_equal(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f58]) ).
fof(f60,plain,
! [Y] :
( ! [X] :
( less_or_equal(X,Y)
| less_or_equal(Y,X)
| ~ defined(X) )
| ~ defined(Y) ),
inference(miniscoping,[status(esa)],[f18]) ).
fof(f61,plain,
! [X0,X1] :
( less_or_equal(X0,X1)
| less_or_equal(X1,X0)
| ~ defined(X0)
| ~ defined(X1) ),
inference(cnf_transformation,[status(esa)],[f60]) ).
fof(f62,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(f63,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)],[f62]) ).
fof(f67,plain,
! [X0,X1] :
( equalish(X0,X1)
| ~ equalish(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f68,plain,
! [Z,Y] :
( ! [X] :
( equalish(X,Z)
| ~ equalish(X,Y) )
| ~ equalish(Y,Z) ),
inference(miniscoping,[status(esa)],[f23]) ).
fof(f69,plain,
! [X0,X1,X2] :
( equalish(X0,X1)
| ~ equalish(X0,X2)
| ~ equalish(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f68]) ).
fof(f74,plain,
! [Y,X] :
( ! [Z] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z) )
| ~ equalish(X,Y) ),
inference(miniscoping,[status(esa)],[f26]) ).
fof(f75,plain,
! [X0,X1,X2] :
( less_or_equal(X0,X1)
| ~ less_or_equal(X2,X1)
| ~ equalish(X2,X0) ),
inference(cnf_transformation,[status(esa)],[f74]) ).
fof(f77,plain,
defined(a),
inference(cnf_transformation,[status(esa)],[f28]) ).
fof(f78,plain,
defined(b),
inference(cnf_transformation,[status(esa)],[f29]) ).
fof(f79,plain,
defined(c),
inference(cnf_transformation,[status(esa)],[f30]) ).
fof(f80,plain,
equalish(add(a,b),c),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f81,plain,
less_or_equal(additive_identity,a),
inference(cnf_transformation,[status(esa)],[f32]) ).
fof(f82,plain,
less_or_equal(additive_identity,b),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f83,plain,
~ less_or_equal(additive_identity,c),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f96,plain,
equalish(c,add(a,b)),
inference(resolution,[status(thm)],[f67,f80]) ).
fof(f100,plain,
equalish(add(additive_identity,a),a),
inference(resolution,[status(thm)],[f37,f77]) ).
fof(f104,plain,
! [X0] :
( equalish(add(a,X0),add(X0,a))
| ~ defined(X0) ),
inference(resolution,[status(thm)],[f40,f77]) ).
fof(f131,plain,
! [X0] :
( less_or_equal(additive_identity,X0)
| ~ less_or_equal(a,X0) ),
inference(resolution,[status(thm)],[f59,f81]) ).
fof(f136,plain,
! [X0] :
( equalish(c,X0)
| ~ equalish(add(a,b),X0) ),
inference(resolution,[status(thm)],[f69,f96]) ).
fof(f308,plain,
! [X0] :
( less_or_equal(c,X0)
| less_or_equal(X0,c)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[f61,f79]) ).
fof(f312,plain,
( spl0_24
<=> less_or_equal(c,c) ),
introduced(split_symbol_definition) ).
fof(f313,plain,
( less_or_equal(c,c)
| ~ spl0_24 ),
inference(component_clause,[status(thm)],[f312]) ).
fof(f315,plain,
( less_or_equal(c,c)
| less_or_equal(c,c) ),
inference(resolution,[status(thm)],[f308,f79]) ).
fof(f316,plain,
spl0_24,
inference(split_clause,[status(thm)],[f315,f312]) ).
fof(f325,plain,
( spl0_27
<=> less_or_equal(c,a) ),
introduced(split_symbol_definition) ).
fof(f326,plain,
( less_or_equal(c,a)
| ~ spl0_27 ),
inference(component_clause,[status(thm)],[f325]) ).
fof(f328,plain,
( spl0_28
<=> less_or_equal(a,c) ),
introduced(split_symbol_definition) ).
fof(f329,plain,
( less_or_equal(a,c)
| ~ spl0_28 ),
inference(component_clause,[status(thm)],[f328]) ).
fof(f331,plain,
( less_or_equal(c,a)
| less_or_equal(a,c) ),
inference(resolution,[status(thm)],[f308,f77]) ).
fof(f332,plain,
( spl0_27
| spl0_28 ),
inference(split_clause,[status(thm)],[f331,f325,f328]) ).
fof(f336,plain,
( spl0_30
<=> less_or_equal(additive_identity,c) ),
introduced(split_symbol_definition) ).
fof(f337,plain,
( less_or_equal(additive_identity,c)
| ~ spl0_30 ),
inference(component_clause,[status(thm)],[f336]) ).
fof(f393,plain,
! [X0,X1] :
( less_or_equal(add(X0,a),add(X1,a))
| ~ less_or_equal(X0,X1) ),
inference(resolution,[status(thm)],[f63,f77]) ).
fof(f516,plain,
less_or_equal(add(additive_identity,a),add(b,a)),
inference(resolution,[status(thm)],[f393,f82]) ).
fof(f521,plain,
! [X0] :
( less_or_equal(X0,add(b,a))
| ~ equalish(add(additive_identity,a),X0) ),
inference(resolution,[status(thm)],[f516,f75]) ).
fof(f646,plain,
! [X0] :
( less_or_equal(X0,c)
| ~ equalish(c,X0)
| ~ spl0_24 ),
inference(resolution,[status(thm)],[f313,f75]) ).
fof(f664,plain,
! [X0] :
( less_or_equal(X0,a)
| ~ equalish(c,X0)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f326,f75]) ).
fof(f666,plain,
( spl0_67
<=> equalish(c,a) ),
introduced(split_symbol_definition) ).
fof(f667,plain,
( equalish(c,a)
| ~ spl0_67 ),
inference(component_clause,[status(thm)],[f666]) ).
fof(f759,plain,
( less_or_equal(a,c)
| ~ spl0_24
| ~ spl0_67 ),
inference(resolution,[status(thm)],[f646,f667]) ).
fof(f777,plain,
( less_or_equal(additive_identity,c)
| ~ spl0_24
| ~ spl0_67 ),
inference(resolution,[status(thm)],[f759,f131]) ).
fof(f778,plain,
( $false
| ~ spl0_24
| ~ spl0_67 ),
inference(forward_subsumption_resolution,[status(thm)],[f777,f83]) ).
fof(f779,plain,
( ~ spl0_24
| ~ spl0_67 ),
inference(contradiction_clause,[status(thm)],[f778]) ).
fof(f1290,plain,
! [X0] :
( less_or_equal(multiplicative_identity,X0)
| less_or_equal(X0,multiplicative_identity)
| ~ defined(X0) ),
inference(resolution,[status(thm)],[f55,f61]) ).
fof(f2816,plain,
equalish(add(a,b),add(b,a)),
inference(resolution,[status(thm)],[f104,f78]) ).
fof(f2996,plain,
equalish(c,add(b,a)),
inference(resolution,[status(thm)],[f2816,f136]) ).
fof(f3005,plain,
! [X0] :
( equalish(add(a,b),X0)
| ~ equalish(add(b,a),X0) ),
inference(resolution,[status(thm)],[f2816,f69]) ).
fof(f3733,plain,
less_or_equal(a,add(b,a)),
inference(resolution,[status(thm)],[f521,f100]) ).
fof(f3745,plain,
( spl0_251
<=> equalish(a,add(b,a)) ),
introduced(split_symbol_definition) ).
fof(f3746,plain,
( equalish(a,add(b,a))
| ~ spl0_251 ),
inference(component_clause,[status(thm)],[f3745]) ).
fof(f3748,plain,
( spl0_252
<=> less_or_equal(add(b,a),a) ),
introduced(split_symbol_definition) ).
fof(f3750,plain,
( ~ less_or_equal(add(b,a),a)
| spl0_252 ),
inference(component_clause,[status(thm)],[f3748]) ).
fof(f3751,plain,
( equalish(a,add(b,a))
| ~ less_or_equal(add(b,a),a) ),
inference(resolution,[status(thm)],[f3733,f57]) ).
fof(f3752,plain,
( spl0_251
| ~ spl0_252 ),
inference(split_clause,[status(thm)],[f3751,f3745,f3748]) ).
fof(f3933,plain,
( $false
| ~ spl0_30 ),
inference(forward_subsumption_resolution,[status(thm)],[f337,f83]) ).
fof(f3934,plain,
~ spl0_30,
inference(contradiction_clause,[status(thm)],[f3933]) ).
fof(f4018,plain,
( less_or_equal(add(b,a),a)
| ~ spl0_27 ),
inference(resolution,[status(thm)],[f664,f2996]) ).
fof(f4019,plain,
( $false
| spl0_252
| ~ spl0_27 ),
inference(forward_subsumption_resolution,[status(thm)],[f4018,f3750]) ).
fof(f4020,plain,
( spl0_252
| ~ spl0_27 ),
inference(contradiction_clause,[status(thm)],[f4019]) ).
fof(f4024,plain,
( less_or_equal(additive_identity,c)
| ~ spl0_28 ),
inference(resolution,[status(thm)],[f329,f131]) ).
fof(f4025,plain,
( spl0_30
| ~ spl0_28 ),
inference(split_clause,[status(thm)],[f4024,f336,f328]) ).
fof(f6764,plain,
( equalish(add(b,a),a)
| ~ spl0_251 ),
inference(resolution,[status(thm)],[f3746,f67]) ).
fof(f6825,plain,
( spl0_509
<=> equalish(add(a,b),a) ),
introduced(split_symbol_definition) ).
fof(f6826,plain,
( equalish(add(a,b),a)
| ~ spl0_509 ),
inference(component_clause,[status(thm)],[f6825]) ).
fof(f14052,plain,
( spl0_968
<=> less_or_equal(multiplicative_identity,multiplicative_identity) ),
introduced(split_symbol_definition) ).
fof(f14055,plain,
( less_or_equal(multiplicative_identity,multiplicative_identity)
| less_or_equal(multiplicative_identity,multiplicative_identity) ),
inference(resolution,[status(thm)],[f1290,f55]) ).
fof(f14056,plain,
spl0_968,
inference(split_clause,[status(thm)],[f14055,f14052]) ).
fof(f15813,plain,
( equalish(c,a)
| ~ spl0_509 ),
inference(resolution,[status(thm)],[f6826,f136]) ).
fof(f15814,plain,
( spl0_67
| ~ spl0_509 ),
inference(split_clause,[status(thm)],[f15813,f666,f6825]) ).
fof(f16687,plain,
( equalish(add(a,b),a)
| ~ spl0_251 ),
inference(resolution,[status(thm)],[f3005,f6764]) ).
fof(f16688,plain,
( spl0_509
| ~ spl0_251 ),
inference(split_clause,[status(thm)],[f16687,f6825,f3745]) ).
fof(f16695,plain,
$false,
inference(sat_refutation,[status(thm)],[f316,f332,f779,f3752,f3934,f4020,f4025,f14056,f15814,f16688]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : FLD070-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.03/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.33 % Computer : n027.cluster.edu
% 0.10/0.33 % Model : x86_64 x86_64
% 0.10/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.33 % Memory : 8042.1875MB
% 0.10/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.33 % CPULimit : 300
% 0.10/0.33 % WCLimit : 300
% 0.10/0.33 % DateTime : Mon Apr 29 23:47:32 EDT 2024
% 0.10/0.33 % CPUTime :
% 0.10/0.34 % Drodi V3.6.0
% 49.68/6.62 % Refutation found
% 49.68/6.62 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 49.68/6.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 49.97/6.71 % Elapsed time: 6.362816 seconds
% 49.97/6.71 % CPU time: 50.084713 seconds
% 49.97/6.71 % Total memory used: 203.145 MB
% 49.97/6.71 % Net memory used: 189.298 MB
%------------------------------------------------------------------------------