%------------------------------------------------------------------------------
% File : Z3---4.15.1
% Problem : FLD067-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp
% Command : run_E %s %d THM
% Computer : n010.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 : Sat Jun 21 05:05:07 AM UTC 2025
% Result : Unsatisfiable 0.11s 0.38s
% Output : Proof 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 30
% Syntax : Number of formulae : 65 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 320 ( 0 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 443 ( 206 ~; 202 |; 0 &)
% ( 35 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of FOOLs : 18 ( 18 fml; 0 var)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 144 ( 130 !; 0 ?; 144 :)
% Comments :
%------------------------------------------------------------------------------
tff(less_or_equal_type,type,
less_or_equal: ( $i * $i ) > $o ).
tff(add_type,type,
add: ( $i * $i ) > $i ).
tff(additive_inverse_type,type,
additive_inverse: $i > $i ).
tff(a_type,type,
a: $i ).
tff(b_type,type,
b: $i ).
tff(defined_type,type,
defined: $i > $o ).
tff(equalish_type,type,
equalish: ( $i * $i ) > $o ).
tff(additive_identity_type,type,
additive_identity: $i ).
tff(1,plain,
( defined(a)
<=> defined(a) ),
inference(rewrite,[status(thm)],[]) ).
tff(2,axiom,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
tff(3,plain,
defined(a),
inference(modus_ponens,[status(thm)],[2,1]) ).
tff(4,plain,
^ [X: $i] :
refl(( ( defined(additive_inverse(X))
| ~ defined(X) )
<=> ( defined(additive_inverse(X))
| ~ defined(X) ) )),
inference(bind,[status(th)],[]) ).
tff(5,plain,
( ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
<=> ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ) ),
inference(quant_intro,[status(thm)],[4]) ).
tff(6,plain,
( ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
<=> ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(7,axiom,
! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
tff(8,plain,
! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ),
inference(modus_ponens,[status(thm)],[7,6]) ).
tff(9,plain,
! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ),
inference(skolemize,[status(sab)],[8]) ).
tff(10,plain,
! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) ),
inference(modus_ponens,[status(thm)],[9,5]) ).
tff(11,plain,
( ( ~ ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
| defined(additive_inverse(a))
| ~ defined(a) )
<=> ( ~ ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
| defined(additive_inverse(a))
| ~ defined(a) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(12,plain,
( ~ ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
| defined(additive_inverse(a))
| ~ defined(a) ),
inference(quant_inst,[status(thm)],[]) ).
tff(13,plain,
( ~ ! [X: $i] :
( defined(additive_inverse(X))
| ~ defined(X) )
| defined(additive_inverse(a))
| ~ defined(a) ),
inference(modus_ponens,[status(thm)],[12,11]) ).
tff(14,plain,
defined(additive_inverse(a)),
inference(unit_resolution,[status(thm)],[13,10,3]) ).
tff(15,plain,
( less_or_equal(a,b)
<=> less_or_equal(a,b) ),
inference(rewrite,[status(thm)],[]) ).
tff(16,axiom,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_3) ).
tff(17,plain,
less_or_equal(a,b),
inference(modus_ponens,[status(thm)],[16,15]) ).
tff(18,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(( ( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
<=> ( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) )),
inference(bind,[status(th)],[]) ).
tff(19,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) ),
inference(quant_intro,[status(thm)],[18]) ).
tff(20,plain,
( ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(21,plain,
^ [Z: $i,Y: $i,X: $i] :
trans(monotonicity(rewrite(( ( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z) )
<=> ( ~ defined(Z)
| less_or_equal(add(X,Z),add(Y,Z)) ) )),
( ( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) )
<=> ( ~ defined(Z)
| less_or_equal(add(X,Z),add(Y,Z))
| ~ less_or_equal(X,Y) ) )),
rewrite(( ( ~ defined(Z)
| less_or_equal(add(X,Z),add(Y,Z))
| ~ less_or_equal(X,Y) )
<=> ( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) )),
( ( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) )
<=> ( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) )),
inference(bind,[status(th)],[]) ).
tff(22,plain,
( ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) )
<=> ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ) ),
inference(quant_intro,[status(thm)],[21]) ).
tff(23,axiom,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(add(X,Z),add(Y,Z))
| ~ defined(Z)
| ~ less_or_equal(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
tff(24,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ),
inference(modus_ponens,[status(thm)],[23,22]) ).
tff(25,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ),
inference(modus_ponens,[status(thm)],[24,20]) ).
tff(26,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ),
inference(skolemize,[status(sab)],[25]) ).
tff(27,plain,
! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) ),
inference(modus_ponens,[status(thm)],[26,19]) ).
tff(28,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
| ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
| ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(29,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
| ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(quant_inst,[status(thm)],[]) ).
tff(30,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( ~ defined(Z)
| ~ less_or_equal(X,Y)
| less_or_equal(add(X,Z),add(Y,Z)) )
| ~ defined(additive_inverse(a))
| ~ less_or_equal(a,b)
| less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(modus_ponens,[status(thm)],[29,28]) ).
tff(31,plain,
less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))),
inference(unit_resolution,[status(thm)],[30,27,17,14]) ).
tff(32,plain,
^ [X: $i] :
refl(( ( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
<=> ( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ) )),
inference(bind,[status(th)],[]) ).
tff(33,plain,
( ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
<=> ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ) ),
inference(quant_intro,[status(thm)],[32]) ).
tff(34,plain,
( ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
<=> ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(35,axiom,
! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
tff(36,plain,
! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
inference(modus_ponens,[status(thm)],[35,34]) ).
tff(37,plain,
! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
inference(skolemize,[status(sab)],[36]) ).
tff(38,plain,
! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) ),
inference(modus_ponens,[status(thm)],[37,33]) ).
tff(39,plain,
( ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) )
<=> ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(40,plain,
( ( equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) )
<=> ( ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(41,plain,
( ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) )
<=> ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ) ),
inference(monotonicity,[status(thm)],[40]) ).
tff(42,plain,
( ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) )
<=> ( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ) ),
inference(transitivity,[status(thm)],[41,39]) ).
tff(43,plain,
( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(a) ),
inference(quant_inst,[status(thm)],[]) ).
tff(44,plain,
( ~ ! [X: $i] :
( equalish(add(X,additive_inverse(X)),additive_identity)
| ~ defined(X) )
| ~ defined(a)
| equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(modus_ponens,[status(thm)],[43,42]) ).
tff(45,plain,
equalish(add(a,additive_inverse(a)),additive_identity),
inference(unit_resolution,[status(thm)],[44,38,3]) ).
tff(46,plain,
( ~ less_or_equal(additive_identity,add(b,additive_inverse(a)))
<=> ~ less_or_equal(additive_identity,add(b,additive_inverse(a))) ),
inference(rewrite,[status(thm)],[]) ).
tff(47,axiom,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_4) ).
tff(48,plain,
~ less_or_equal(additive_identity,add(b,additive_inverse(a))),
inference(modus_ponens,[status(thm)],[47,46]) ).
tff(49,plain,
^ [Z: $i,Y: $i,X: $i] :
refl(( ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) )),
inference(bind,[status(th)],[]) ).
tff(50,plain,
( ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) ),
inference(quant_intro,[status(thm)],[49]) ).
tff(51,plain,
( ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(52,plain,
^ [Z: $i,Y: $i,X: $i] :
trans(monotonicity(rewrite(( ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z) )
<=> ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z) ) )),
( ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) )),
rewrite(( ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) )),
( ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) )),
inference(bind,[status(th)],[]) ).
tff(53,plain,
( ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
<=> ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ) ),
inference(quant_intro,[status(thm)],[52]) ).
tff(54,axiom,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
tff(55,plain,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
inference(modus_ponens,[status(thm)],[54,53]) ).
tff(56,plain,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
inference(modus_ponens,[status(thm)],[55,51]) ).
tff(57,plain,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
inference(skolemize,[status(sab)],[56]) ).
tff(58,plain,
! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) ),
inference(modus_ponens,[status(thm)],[57,50]) ).
tff(59,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(60,plain,
( ( less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity) )
<=> ( less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ) ),
inference(rewrite,[status(thm)],[]) ).
tff(61,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ) ),
inference(monotonicity,[status(thm)],[60]) ).
tff(62,plain,
( ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity) )
<=> ( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ) ),
inference(transitivity,[status(thm)],[61,59]) ).
tff(63,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity) ),
inference(quant_inst,[status(thm)],[]) ).
tff(64,plain,
( ~ ! [Z: $i,Y: $i,X: $i] :
( less_or_equal(Y,Z)
| ~ less_or_equal(X,Z)
| ~ equalish(X,Y) )
| less_or_equal(additive_identity,add(b,additive_inverse(a)))
| ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ less_or_equal(add(a,additive_inverse(a)),add(b,additive_inverse(a))) ),
inference(modus_ponens,[status(thm)],[63,62]) ).
tff(65,plain,
$false,
inference(unit_resolution,[status(thm)],[64,58,48,45,31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : FLD067-1 : TPTP v9.0.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n010.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Thu Jun 19 13:43:26 EDT 2025
% 0.11/0.33 % CPUTime :
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % SZS output start Proof
% See solution above
% 0.11/0.39 % E exiting
%------------------------------------------------------------------------------