%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD015-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:23:08 PM UTC 2026
% Result : Unsatisfiable 32.88s 4.60s
% Output : CNFRefutation 32.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 14
% Syntax : Number of clauses : 106 ( 35 unt; 0 nHn; 106 RR)
% Number of literals : 218 ( 0 equ; 115 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(additive_inverse_equals_additive_inverse_3,negated_conjecture,
equalish(additive_inverse(a),additive_inverse(b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_equals_additive_inverse_3) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
cnf(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(a_not_equal_to_b_4,negated_conjecture,
~ equalish(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_b_4) ).
cnf(c_0_14,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_15,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_16,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_17,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_14 ).
cnf(c_0_18,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_15 ).
cnf(c_0_19,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
equalish(additive_inverse(a),additive_inverse(b)),
additive_inverse_equals_additive_inverse_3 ).
cnf(c_0_21,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_22,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_23,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ defined(X1)
| equalish(add(additive_inverse(a),X1),add(additive_inverse(b),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_22 ).
cnf(c_0_27,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_28,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_29,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(add(additive_inverse(a),additive_inverse(additive_inverse(b))),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_30,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_31,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_32,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_33,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
equalish(add(additive_inverse(a),additive_inverse(additive_inverse(b))),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_25]),c_0_30])]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_38,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
equalish(additive_identity,add(additive_inverse(a),additive_inverse(additive_inverse(b)))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_36]) ).
cnf(c_0_41,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_37 ).
cnf(c_0_42,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_43,negated_conjecture,
( ~ defined(additive_inverse(a))
| ~ defined(additive_inverse(additive_inverse(b)))
| equalish(additive_identity,add(additive_inverse(additive_inverse(b)),additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_45,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(X1,add(additive_inverse(X1),X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(add(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_33]) ).
cnf(c_0_47,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_42 ).
cnf(c_0_48,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(b)))
| equalish(additive_identity,add(additive_inverse(additive_inverse(b)),additive_inverse(a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_25]),c_0_44])]) ).
cnf(c_0_49,plain,
( ~ equalish(X1,add(X3,add(additive_inverse(X3),X2)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_45]) ).
cnf(c_0_50,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X3,add(X2,X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(additive_identity,add(additive_inverse(additive_inverse(b)),additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_52,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(add(X1,additive_inverse(X2)),X2),X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_25]) ).
cnf(c_0_53,negated_conjecture,
equalish(additive_identity,add(additive_inverse(additive_inverse(b)),additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_25]),c_0_30])]) ).
cnf(c_0_54,plain,
( ~ equalish(X1,add(add(X2,additive_inverse(X3)),X3))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
( ~ defined(X1)
| equalish(add(additive_identity,X1),add(add(additive_inverse(additive_inverse(b)),additive_inverse(a)),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_53]) ).
cnf(c_0_56,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_57,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_58,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(b)))
| equalish(add(additive_identity,a),additive_inverse(additive_inverse(b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_44])]) ).
cnf(c_0_59,plain,
( ~ defined(additive_inverse(additive_identity))
| equalish(additive_inverse(additive_identity),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_56]),c_0_57])]) ).
cnf(c_0_60,negated_conjecture,
equalish(additive_inverse(b),additive_inverse(a)),
inference(spm,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_61,negated_conjecture,
( ~ defined(additive_inverse(b))
| equalish(add(additive_identity,a),additive_inverse(additive_inverse(b))) ),
inference(spm,[status(thm)],[c_0_58,c_0_25]) ).
cnf(c_0_62,plain,
equalish(additive_inverse(additive_identity),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_25]),c_0_57])]) ).
cnf(c_0_63,negated_conjecture,
( ~ defined(X1)
| equalish(add(additive_inverse(b),X1),add(additive_inverse(a),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_60]) ).
cnf(c_0_64,negated_conjecture,
equalish(add(additive_identity,a),additive_inverse(additive_inverse(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_25]),c_0_30])]) ).
cnf(c_0_65,plain,
equalish(additive_identity,additive_inverse(additive_identity)),
inference(spm,[status(thm)],[c_0_34,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(additive_inverse(b),additive_inverse(additive_inverse(a))),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_63]),c_0_25]) ).
cnf(c_0_67,negated_conjecture,
equalish(additive_inverse(additive_inverse(b)),add(additive_identity,a)),
inference(spm,[status(thm)],[c_0_34,c_0_64]) ).
cnf(c_0_68,plain,
( ~ equalish(X1,additive_identity)
| equalish(X1,additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_17,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
equalish(add(additive_inverse(b),additive_inverse(additive_inverse(a))),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_25]),c_0_44])]) ).
cnf(c_0_70,negated_conjecture,
equalish(additive_inverse(additive_inverse(b)),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_67]),c_0_44])]) ).
cnf(c_0_71,negated_conjecture,
equalish(add(additive_inverse(b),additive_inverse(additive_inverse(a))),additive_inverse(additive_identity)),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
equalish(additive_identity,add(additive_inverse(b),additive_inverse(additive_inverse(a)))),
inference(spm,[status(thm)],[c_0_34,c_0_69]) ).
cnf(c_0_73,negated_conjecture,
( ~ equalish(X1,additive_inverse(additive_inverse(b)))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( ~ equalish(X1,add(additive_inverse(b),additive_inverse(additive_inverse(a))))
| equalish(X1,additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_17,c_0_71]) ).
cnf(c_0_75,negated_conjecture,
( ~ defined(additive_inverse(b))
| ~ defined(additive_inverse(additive_inverse(a)))
| equalish(additive_identity,add(additive_inverse(additive_inverse(a)),additive_inverse(b))) ),
inference(spm,[status(thm)],[c_0_38,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_73,c_0_64]) ).
cnf(c_0_77,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(a)))
| equalish(add(additive_inverse(a),additive_inverse(additive_inverse(a))),additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_74,c_0_24]) ).
cnf(c_0_78,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(a)))
| equalish(additive_identity,add(additive_inverse(additive_inverse(a)),additive_inverse(b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_25]),c_0_30])]) ).
cnf(c_0_79,negated_conjecture,
( ~ equalish(X1,add(additive_identity,a))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_76]) ).
cnf(c_0_80,plain,
( ~ defined(X1)
| equalish(add(additive_inverse(additive_identity),X1),add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_62]) ).
cnf(c_0_81,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(additive_inverse(a),additive_inverse(additive_inverse(a))),additive_inverse(additive_identity)) ),
inference(spm,[status(thm)],[c_0_77,c_0_25]) ).
cnf(c_0_82,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(additive_identity,add(additive_inverse(additive_inverse(a)),additive_inverse(b))) ),
inference(spm,[status(thm)],[c_0_78,c_0_25]) ).
cnf(c_0_83,negated_conjecture,
equalish(add(additive_inverse(additive_identity),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_44])]) ).
cnf(c_0_84,negated_conjecture,
equalish(add(additive_inverse(a),additive_inverse(additive_inverse(a))),additive_inverse(additive_identity)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_25]),c_0_44])]) ).
cnf(c_0_85,negated_conjecture,
equalish(additive_identity,add(additive_inverse(additive_inverse(a)),additive_inverse(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_25]),c_0_44])]) ).
cnf(c_0_86,negated_conjecture,
( ~ equalish(X1,add(additive_inverse(additive_identity),a))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_17,c_0_83]) ).
cnf(c_0_87,negated_conjecture,
( ~ defined(X1)
| equalish(add(add(additive_inverse(a),additive_inverse(additive_inverse(a))),X1),add(additive_inverse(additive_identity),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_84]) ).
cnf(c_0_88,negated_conjecture,
( ~ defined(X1)
| equalish(add(additive_identity,X1),add(add(additive_inverse(additive_inverse(a)),additive_inverse(b)),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_85]) ).
cnf(c_0_89,negated_conjecture,
equalish(add(add(additive_inverse(a),additive_inverse(additive_inverse(a))),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_44])]) ).
cnf(c_0_90,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(a)))
| equalish(add(additive_identity,b),additive_inverse(additive_inverse(a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_88]),c_0_30])]) ).
cnf(c_0_91,plain,
( ~ equalish(X1,add(add(X3,X2),X4))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X4)
| equalish(X1,add(add(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_46]) ).
cnf(c_0_92,negated_conjecture,
equalish(a,add(add(additive_inverse(a),additive_inverse(additive_inverse(a))),a)),
inference(spm,[status(thm)],[c_0_34,c_0_89]) ).
cnf(c_0_93,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(additive_identity,b),additive_inverse(additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_90,c_0_25]) ).
cnf(c_0_94,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(a,add(add(additive_inverse(additive_inverse(a)),additive_inverse(a)),a)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_44])]),c_0_25]) ).
cnf(c_0_95,negated_conjecture,
equalish(add(additive_identity,b),additive_inverse(additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_25]),c_0_44])]) ).
cnf(c_0_96,negated_conjecture,
equalish(a,add(add(additive_inverse(additive_inverse(a)),additive_inverse(a)),a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_25]),c_0_44])]) ).
cnf(c_0_97,negated_conjecture,
equalish(additive_inverse(additive_inverse(a)),add(additive_identity,b)),
inference(spm,[status(thm)],[c_0_34,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
( ~ defined(additive_inverse(additive_inverse(a)))
| equalish(a,additive_inverse(additive_inverse(a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_96]),c_0_44])]) ).
cnf(c_0_99,negated_conjecture,
equalish(additive_inverse(additive_inverse(a)),b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_97]),c_0_30])]) ).
cnf(c_0_100,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(a,additive_inverse(additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_98,c_0_25]) ).
cnf(c_0_101,negated_conjecture,
~ equalish(a,b),
inference(fof_simplification,[status(thm)],[a_not_equal_to_b_4]) ).
cnf(c_0_102,negated_conjecture,
( ~ equalish(X1,additive_inverse(additive_inverse(a)))
| equalish(X1,b) ),
inference(spm,[status(thm)],[c_0_17,c_0_99]) ).
cnf(c_0_103,negated_conjecture,
equalish(a,additive_inverse(additive_inverse(a))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_25]),c_0_44])]) ).
cnf(c_0_104,negated_conjecture,
~ equalish(a,b),
c_0_101 ).
cnf(c_0_105,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD015-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n011.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Mon Sep 21 15:37:25 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 32.88/4.60 % Version: 3.5.1
% 32.88/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.88/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.88/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.88/4.60 % Starting new_bool_3 with 300s (1) cores
% 32.88/4.60 % Starting new_bool_1 with 300s (1) cores
% 32.88/4.60 % Starting sh5l with 300s (1) cores
% 32.88/4.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2261963 completed with status 0
% 32.88/4.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 32.88/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.88/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.88/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.88/4.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 32.88/4.60 % No SInE strategy applied
% 32.88/4.60 % Search class: FGUNF-FFMS21-SFFFFFNN
% 32.88/4.60 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 32.88/4.60 % Starting SubtermCWHack with 136s (1) cores
% 32.88/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 32.88/4.60 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 32.88/4.60 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 32.88/4.60 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 32.88/4.60 % G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with pid 2261971 completed with status 0
% 32.88/4.60 % Result found by G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c
% 32.88/4.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.88/4.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.88/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.88/4.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 32.88/4.60 % No SInE strategy applied
% 32.88/4.60 % Search class: FGUNF-FFMS21-SFFFFFNN
% 32.88/4.60 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 32.88/4.60 % Starting SubtermCWHack with 136s (1) cores
% 32.88/4.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 32.88/4.60 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 32.88/4.60 % Preprocessing time : 0.001 s
% 32.88/4.60 % Presaturation interreduction done
% 32.88/4.60
% 32.88/4.60 % Proof found!
% 32.88/4.60 % SZS status Unsatisfiable
% 32.88/4.60 % SZS output start CNFRefutation
% See solution above
% 32.88/4.60 % Parsed axioms : 31
% 32.88/4.60 % Removed by relevancy pruning/SinE : 0
% 32.88/4.60 % Initial clauses : 31
% 32.88/4.60 % Removed in clause preprocessing : 0
% 32.88/4.60 % Initial clauses in saturation : 31
% 32.88/4.60 % Processed clauses : 24117
% 32.88/4.60 % ...of these trivial : 5069
% 32.88/4.60 % ...subsumed : 9176
% 32.88/4.60 % ...remaining for further processing : 9872
% 32.88/4.60 % Other redundant clauses eliminated : 0
% 32.88/4.60 % Clauses deleted for lack of memory : 0
% 32.88/4.60 % Backward-subsumed : 392
% 32.88/4.60 % Backward-rewritten : 995
% 32.88/4.60 % Generated clauses : 525283
% 32.88/4.60 % ...of the previous two non-redundant : 473860
% 32.88/4.60 % ...aggressively subsumed : 0
% 32.88/4.60 % Contextual simplify-reflections : 198
% 32.88/4.60 % Paramodulations : 525263
% 32.88/4.60 % Factorizations : 20
% 32.88/4.60 % NegExts : 0
% 32.88/4.60 % Equation resolutions : 0
% 32.88/4.60 % Disequality decompositions : 0
% 32.88/4.60 % Total rewrite steps : 174376
% 32.88/4.60 % ...of those cached : 172350
% 32.88/4.60 % Propositional unsat checks : 0
% 32.88/4.60 % Propositional check models : 0
% 32.88/4.60 % Propositional check unsatisfiable : 0
% 32.88/4.60 % Propositional clauses : 0
% 32.88/4.60 % Propositional clauses after purity: 0
% 32.88/4.60 % Propositional unsat core size : 0
% 32.88/4.60 % Propositional preprocessing time : 0.000
% 32.88/4.60 % Propositional encoding time : 0.000
% 32.88/4.60 % Propositional solver time : 0.000
% 32.88/4.60 % Success case prop preproc time : 0.000
% 32.88/4.60 % Success case prop encoding time : 0.000
% 32.88/4.60 % Success case prop solver time : 0.000
% 32.88/4.60 % Current number of processed clauses : 8454
% 32.88/4.60 % Positive orientable unit clauses : 2038
% 32.88/4.60 % Positive unorientable unit clauses: 0
% 32.88/4.60 % Negative unit clauses : 2
% 32.88/4.60 % Non-unit-clauses : 6414
% 32.88/4.60 % Current number of unprocessed clauses: 449293
% 32.88/4.60 % ...number of literals in the above : 1074063
% 32.88/4.60 % Current number of archived formulas : 0
% 32.88/4.60 % Current number of archived clauses : 1418
% 32.88/4.60 % Clause-clause subsumption calls (NU) : 2072415
% 32.88/4.60 % Rec. Clause-clause subsumption calls : 1546268
% 32.88/4.60 % Non-unit clause-clause subsumptions : 9766
% 32.88/4.60 % Unit Clause-clause subsumption calls : 176661
% 32.88/4.60 % Rewrite failures with RHS unbound : 0
% 32.88/4.60 % BW rewrite match attempts : 10542
% 32.88/4.60 % BW rewrite match successes : 751
% 32.88/4.60 % Condensation attempts : 0
% 32.88/4.60 % Condensation successes : 0
% 32.88/4.60 % Termbank termtop insertions : 8679395
% 32.88/4.60 % Search garbage collected termcells : 71
% 32.88/4.60
% 32.88/4.60 % -------------------------------------------------
% 32.88/4.60 % User time : 3.819 s
% 32.88/4.60 % System time : 0.238 s
% 32.88/4.60 % Total time : 4.057 s
% 32.88/4.60 % Maximum resident set size: 3608 pages
% 32.88/4.60
% 32.88/4.60 % -------------------------------------------------
% 32.88/4.60 % User time : 19.433 s
% 32.88/4.60 % System time : 0.834 s
% 32.88/4.60 % Total time : 20.267 s
% 32.88/4.60 % Maximum resident set size: 4608 pages
% 32.88/4.60 % E exiting
%------------------------------------------------------------------------------