%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD024-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 : n008.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:22:43 PM UTC 2026
% Result : Unsatisfiable 21.86s 3.63s
% Output : CNFRefutation 21.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 18
% Syntax : Number of clauses : 103 ( 24 unt; 5 nHn; 103 RR)
% Number of literals : 250 ( 0 equ; 147 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 150 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
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(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
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(additive_identity_equals_add_3,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity_equals_add_3) ).
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(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(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_defined) ).
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(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(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(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_19,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_20,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_21,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_22,hypothesis,
( ~ defined(X1)
| less_or_equal(a,X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_21 ).
cnf(c_0_24,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_25,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_26,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_27,hypothesis,
( ~ equalish(a,X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_25 ).
cnf(c_0_29,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_26 ).
cnf(c_0_30,hypothesis,
( ~ equalish(X2,X1)
| ~ equalish(a,X2)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_27]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_33,hypothesis,
( ~ equalish(add(additive_identity,a),X1)
| less_or_equal(X1,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_20])]) ).
cnf(c_0_34,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_32 ).
cnf(c_0_35,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_36,hypothesis,
less_or_equal(add(a,additive_identity),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_20]),c_0_35])]) ).
cnf(c_0_37,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_38,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_39,hypothesis,
( ~ equalish(add(a,additive_identity),X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_40,plain,
( ~ less_or_equal(X1,X3)
| ~ defined(X2)
| less_or_equal(add(X1,X2),add(X3,X2)) ),
c_0_37 ).
cnf(c_0_41,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_42,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_38 ).
cnf(c_0_43,hypothesis,
less_or_equal(add(additive_identity,a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_34]),c_0_35]),c_0_20])]) ).
cnf(c_0_44,plain,
( ~ equalish(add(X4,X3),X1)
| ~ defined(X3)
| ~ less_or_equal(X4,X2)
| less_or_equal(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_40]) ).
cnf(c_0_45,plain,
( ~ defined(X1)
| less_or_equal(additive_identity,X1)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_46,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_41 ).
cnf(c_0_47,negated_conjecture,
equalish(additive_identity,add(b,additive_inverse(a))),
additive_identity_equals_add_3 ).
cnf(c_0_48,hypothesis,
( ~ less_or_equal(a,add(additive_identity,a))
| equalish(a,add(additive_identity,a)) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( ~ defined(X1)
| ~ less_or_equal(additive_identity,X2)
| less_or_equal(X1,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_44,c_0_29]) ).
cnf(c_0_50,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_45,c_0_35]) ).
cnf(c_0_51,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_52,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(X1,add(b,additive_inverse(a))) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,hypothesis,
equalish(a,add(additive_identity,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_20])]) ).
cnf(c_0_54,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_51 ).
cnf(c_0_55,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_56,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(add(b,additive_inverse(a)),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_52]) ).
cnf(c_0_57,hypothesis,
equalish(add(additive_identity,a),a),
inference(spm,[status(thm)],[c_0_28,c_0_53]) ).
cnf(c_0_58,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
cnf(c_0_59,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X1,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_60,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_55 ).
cnf(c_0_61,negated_conjecture,
equalish(add(b,additive_inverse(a)),additive_identity),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_62,negated_conjecture,
( ~ equalish(X2,additive_identity)
| ~ equalish(X1,add(b,additive_inverse(a)))
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_56]) ).
cnf(c_0_63,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_64,hypothesis,
( ~ equalish(X1,add(additive_identity,a))
| equalish(X1,a) ),
inference(spm,[status(thm)],[c_0_46,c_0_57]) ).
cnf(c_0_65,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(additive_identity,X1),X2),add(X1,X2)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_35])]),c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( ~ equalish(X1,add(b,additive_inverse(a)))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_46,c_0_61]) ).
cnf(c_0_67,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_68,negated_conjecture,
( ~ equalish(X1,additive_identity)
| ~ equalish(X2,additive_identity)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_62,c_0_52]) ).
cnf(c_0_69,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_63 ).
cnf(c_0_70,hypothesis,
equalish(add(add(additive_identity,additive_identity),a),a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_20]),c_0_35])]) ).
cnf(c_0_71,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(additive_inverse(a),b),additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_34]),c_0_67])]) ).
cnf(c_0_72,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(X1,add(additive_identity,additive_identity)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_29]),c_0_35])]) ).
cnf(c_0_73,plain,
( ~ equalish(X4,X2)
| ~ equalish(X1,add(X4,X3))
| ~ defined(X3)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_69]) ).
cnf(c_0_74,hypothesis,
equalish(a,add(add(additive_identity,additive_identity),a)),
inference(spm,[status(thm)],[c_0_28,c_0_70]) ).
cnf(c_0_75,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(additive_identity,add(additive_inverse(a),b)) ),
inference(spm,[status(thm)],[c_0_28,c_0_71]) ).
cnf(c_0_76,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(add(additive_identity,additive_identity),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_72]) ).
cnf(c_0_77,hypothesis,
( ~ equalish(add(additive_identity,additive_identity),X1)
| equalish(a,add(X1,a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_20])]) ).
cnf(c_0_78,negated_conjecture,
( ~ equalish(X1,additive_identity)
| ~ defined(additive_inverse(a))
| equalish(X1,add(additive_inverse(a),b)) ),
inference(spm,[status(thm)],[c_0_46,c_0_75]) ).
cnf(c_0_79,negated_conjecture,
equalish(add(additive_identity,additive_identity),additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_76]),c_0_61])]) ).
cnf(c_0_80,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_81,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(add(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_69]) ).
cnf(c_0_82,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_83,plain,
( ~ equalish(X1,add(X2,add(X3,X4)))
| ~ defined(X2)
| ~ defined(X3)
| ~ defined(X4)
| equalish(X1,add(add(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_46,c_0_54]) ).
cnf(c_0_84,plain,
( ~ equalish(X1,add(add(X2,X3),X4))
| ~ defined(X2)
| ~ defined(X3)
| ~ defined(X4)
| equalish(X1,add(X2,add(X3,X4))) ),
inference(spm,[status(thm)],[c_0_46,c_0_59]) ).
cnf(c_0_85,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(a,add(add(additive_inverse(a),b),a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]) ).
cnf(c_0_86,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_80 ).
cnf(c_0_87,plain,
( ~ equalish(X3,additive_identity)
| ~ equalish(X1,add(X3,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_81]) ).
cnf(c_0_88,plain,
( ~ equalish(X1,add(X3,add(X4,X2)))
| ~ defined(X3)
| ~ defined(X4)
| ~ defined(X2)
| equalish(X1,add(X2,add(X3,X4))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_60]) ).
cnf(c_0_89,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(a,add(additive_inverse(a),add(b,a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_20]),c_0_67])]) ).
cnf(c_0_90,negated_conjecture,
~ equalish(a,b),
inference(fof_simplification,[status(thm)],[a_not_equal_to_b_4]) ).
cnf(c_0_91,plain,
( ~ defined(X1)
| equalish(additive_identity,add(X1,additive_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_86]) ).
cnf(c_0_92,plain,
( ~ equalish(add(X4,X3),additive_identity)
| ~ equalish(X1,add(X4,add(X3,X2)))
| ~ defined(X4)
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_87,c_0_83]) ).
cnf(c_0_93,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(a,add(a,add(additive_inverse(a),b))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_20]),c_0_67])]) ).
cnf(c_0_94,negated_conjecture,
~ equalish(a,b),
c_0_90 ).
cnf(c_0_95,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(X1,add(X2,additive_inverse(X2))) ),
inference(spm,[status(thm)],[c_0_46,c_0_91]) ).
cnf(c_0_96,negated_conjecture,
( ~ equalish(add(a,additive_inverse(a)),additive_identity)
| ~ defined(additive_inverse(a)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_67]),c_0_20])]),c_0_94]) ).
cnf(c_0_97,plain,
( ~ equalish(X2,additive_identity)
| ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_95]) ).
cnf(c_0_98,negated_conjecture,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_66,c_0_47]) ).
cnf(c_0_99,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_100,negated_conjecture,
~ defined(additive_inverse(a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_20]),c_0_98])]) ).
cnf(c_0_101,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_99 ).
cnf(c_0_102,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD024-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.12/0.37 % Computer : n008.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 15:39:10 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/0.42 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
% 21.86/3.63 % Version: 3.5.1
% 21.86/3.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.86/3.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.86/3.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.86/3.63 % Starting new_bool_3 with 300s (1) cores
% 21.86/3.63 % Starting new_bool_1 with 300s (1) cores
% 21.86/3.63 % Starting sh5l with 300s (1) cores
% 21.86/3.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1325222 completed with status 0
% 21.86/3.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 21.86/3.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.86/3.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.86/3.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.86/3.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.86/3.63 % No SInE strategy applied
% 21.86/3.63 % Search class: FGUNF-FFMS21-SFFFFFNN
% 21.86/3.63 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 21.86/3.63 % Starting SubtermCWHack with 136s (1) cores
% 21.86/3.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 21.86/3.63 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 21.86/3.63 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 21.86/3.63 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 21.86/3.63 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1325228 completed with status 0
% 21.86/3.63 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 21.86/3.63 % Preprocessing class: FSMSSMSSSSSNFFN.
% 21.86/3.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 21.86/3.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 21.86/3.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 21.86/3.63 % No SInE strategy applied
% 21.86/3.63 % Search class: FGUNF-FFMS21-SFFFFFNN
% 21.86/3.63 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 21.86/3.63 % Starting SubtermCWHack with 136s (1) cores
% 21.86/3.63 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 21.86/3.63 % Preprocessing time : 0.001 s
% 21.86/3.63 % Presaturation interreduction done
% 21.86/3.63
% 21.86/3.63 % Proof found!
% 21.86/3.63 % SZS status Unsatisfiable
% 21.86/3.63 % SZS output start CNFRefutation
% See solution above
% 21.86/3.63 % Parsed axioms : 31
% 21.86/3.63 % Removed by relevancy pruning/SinE : 0
% 21.86/3.63 % Initial clauses : 31
% 21.86/3.63 % Removed in clause preprocessing : 0
% 21.86/3.63 % Initial clauses in saturation : 31
% 21.86/3.63 % Processed clauses : 28586
% 21.86/3.63 % ...of these trivial : 182
% 21.86/3.63 % ...subsumed : 22783
% 21.86/3.63 % ...remaining for further processing : 5621
% 21.86/3.63 % Other redundant clauses eliminated : 0
% 21.86/3.63 % Clauses deleted for lack of memory : 0
% 21.86/3.63 % Backward-subsumed : 1246
% 21.86/3.63 % Backward-rewritten : 48
% 21.86/3.63 % Generated clauses : 222336
% 21.86/3.63 % ...of the previous two non-redundant : 209861
% 21.86/3.63 % ...aggressively subsumed : 0
% 21.86/3.63 % Contextual simplify-reflections : 109
% 21.86/3.63 % Paramodulations : 222271
% 21.86/3.63 % Factorizations : 0
% 21.86/3.63 % NegExts : 0
% 21.86/3.63 % Equation resolutions : 0
% 21.86/3.63 % Disequality decompositions : 0
% 21.86/3.63 % Total rewrite steps : 94732
% 21.86/3.63 % ...of those cached : 94462
% 21.86/3.63 % Propositional unsat checks : 1
% 21.86/3.63 % Propositional check models : 0
% 21.86/3.63 % Propositional check unsatisfiable : 0
% 21.86/3.63 % Propositional clauses : 0
% 21.86/3.63 % Propositional clauses after purity: 0
% 21.86/3.63 % Propositional unsat core size : 0
% 21.86/3.63 % Propositional preprocessing time : 0.000
% 21.86/3.63 % Propositional encoding time : 0.095
% 21.86/3.63 % Propositional solver time : 0.083
% 21.86/3.63 % Success case prop preproc time : 0.000
% 21.86/3.63 % Success case prop encoding time : 0.000
% 21.86/3.63 % Success case prop solver time : 0.000
% 21.86/3.63 % Current number of processed clauses : 4231
% 21.86/3.63 % Positive orientable unit clauses : 292
% 21.86/3.63 % Positive unorientable unit clauses: 0
% 21.86/3.63 % Negative unit clauses : 349
% 21.86/3.63 % Non-unit-clauses : 3590
% 21.86/3.63 % Current number of unprocessed clauses: 179914
% 21.86/3.63 % ...number of literals in the above : 746442
% 21.86/3.63 % Current number of archived formulas : 0
% 21.86/3.63 % Current number of archived clauses : 1390
% 21.86/3.63 % Clause-clause subsumption calls (NU) : 1968075
% 21.86/3.63 % Rec. Clause-clause subsumption calls : 921499
% 21.86/3.63 % Non-unit clause-clause subsumptions : 9961
% 21.86/3.63 % Unit Clause-clause subsumption calls : 201407
% 21.86/3.63 % Rewrite failures with RHS unbound : 0
% 21.86/3.63 % BW rewrite match attempts : 1793
% 21.86/3.63 % BW rewrite match successes : 86
% 21.86/3.63 % Condensation attempts : 0
% 21.86/3.63 % Condensation successes : 0
% 21.86/3.63 % Termbank termtop insertions : 4634693
% 21.86/3.63 % Search garbage collected termcells : 71
% 21.86/3.63
% 21.86/3.63 % -------------------------------------------------
% 21.86/3.63 % User time : 2.887 s
% 21.86/3.63 % System time : 0.134 s
% 21.86/3.63 % Total time : 3.020 s
% 21.86/3.63 % Maximum resident set size: 3660 pages
% 21.86/3.63
% 21.86/3.63 % -------------------------------------------------
% 21.86/3.63 % User time : 14.811 s
% 21.86/3.63 % System time : 0.644 s
% 21.86/3.63 % Total time : 15.455 s
% 21.86/3.63 % Maximum resident set size: 4608 pages
% 21.86/3.63 % E exiting
%------------------------------------------------------------------------------