%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD028-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 : n009.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:44 PM UTC 2026
% Result : Unsatisfiable 19.31s 3.37s
% Output : CNFRefutation 19.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 16
% Syntax : Number of clauses : 97 ( 38 unt; 13 nHn; 97 RR)
% Number of literals : 207 ( 0 equ; 103 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 99 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(existence_of_inverse_multiplication,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_multiplication) ).
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(associativity_multiplication,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_multiplication) ).
cnf(existence_of_identity_multiplication,axiom,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_multiplication) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(a_not_equal_to_additive_identity_5,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_5) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).
cnf(well_definedness_of_multiplicative_inverse,axiom,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplicative_inverse) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).
cnf(commutativity_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(well_definedness_of_multiplication,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_multiplication) ).
cnf(multiply_equals_b_7,negated_conjecture,
equalish(multiply(a,v),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_b_7) ).
cnf(multiply_equals_b_6,negated_conjecture,
equalish(multiply(a,u),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_equals_b_6) ).
cnf(u_not_equal_to_v_8,negated_conjecture,
~ equalish(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_equal_to_v_8) ).
cnf(c_0_16,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_multiplication]) ).
cnf(c_0_17,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_multiplication]) ).
cnf(c_0_18,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_19,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_16 ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X1)),multiplicative_identity) ),
c_0_17 ).
cnf(c_0_21,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_multiplication]) ).
cnf(c_0_22,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_multiplication]) ).
cnf(c_0_23,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_18 ).
cnf(c_0_24,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(X1,multiplicative_inverse(X1)),X2),multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),X3)) ),
c_0_21 ).
cnf(c_0_26,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_27,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_5]) ).
cnf(c_0_28,plain,
( ~ defined(X1)
| equalish(multiply(multiplicative_identity,X1),X1) ),
c_0_22 ).
cnf(c_0_29,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_30,plain,
( ~ equalish(X1,multiply(multiply(X3,multiplicative_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X3,additive_identity)
| equalish(X1,multiply(multiplicative_identity,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,hypothesis,
( ~ defined(X1)
| ~ defined(X2)
| equalish(multiply(a,multiply(X1,X2)),multiply(multiply(a,X1),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
~ equalish(a,additive_identity),
c_0_27 ).
cnf(c_0_33,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplicative_inverse]) ).
cnf(c_0_34,hypothesis,
equalish(multiply(multiplicative_identity,v),v),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,hypothesis,
( ~ defined(X1)
| ~ defined(multiplicative_inverse(a))
| equalish(multiply(a,multiply(multiplicative_inverse(a),X1)),multiply(multiplicative_identity,X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_26])]),c_0_32]) ).
cnf(c_0_36,plain,
( ~ defined(X1)
| equalish(X1,additive_identity)
| defined(multiplicative_inverse(X1)) ),
c_0_33 ).
cnf(c_0_37,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_38,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,v))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_23,c_0_34]) ).
cnf(c_0_39,hypothesis,
( ~ defined(X1)
| equalish(multiply(a,multiply(multiplicative_inverse(a),X1)),multiply(multiplicative_identity,X1)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]),c_0_32]) ).
cnf(c_0_40,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_41,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_multiplication]) ).
cnf(c_0_42,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_37 ).
cnf(c_0_43,hypothesis,
equalish(multiply(a,multiply(multiplicative_inverse(a),v)),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_29])]) ).
cnf(c_0_44,hypothesis,
equalish(multiply(multiplicative_identity,u),u),
inference(spm,[status(thm)],[c_0_28,c_0_40]) ).
cnf(c_0_45,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(multiply(X1,X2),multiply(X2,X1)) ),
c_0_41 ).
cnf(c_0_46,plain,
( ~ equalish(X1,multiply(X2,multiply(X3,X4)))
| ~ defined(X2)
| ~ defined(X3)
| ~ defined(X4)
| equalish(X1,multiply(multiply(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_47,hypothesis,
equalish(v,multiply(a,multiply(multiplicative_inverse(a),v))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,hypothesis,
( ~ equalish(X1,multiply(multiplicative_identity,u))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_23,c_0_44]) ).
cnf(c_0_49,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(multiply(multiply(X1,X2),X3),multiply(multiply(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_45]) ).
cnf(c_0_50,hypothesis,
( ~ defined(multiplicative_inverse(a))
| equalish(v,multiply(multiply(a,multiplicative_inverse(a)),v)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_29]),c_0_26])]) ).
cnf(c_0_51,hypothesis,
equalish(multiply(a,multiply(multiplicative_inverse(a),u)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_39]),c_0_40])]) ).
cnf(c_0_52,plain,
( ~ equalish(X1,multiply(multiply(X3,X2),X4))
| ~ defined(X3)
| ~ defined(X2)
| ~ defined(X4)
| equalish(X1,multiply(multiply(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_53,hypothesis,
equalish(v,multiply(multiply(a,multiplicative_inverse(a)),v)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_36]),c_0_26])]),c_0_32]) ).
cnf(c_0_54,plain,
( ~ equalish(X1,multiply(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,multiply(X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_45]) ).
cnf(c_0_55,hypothesis,
equalish(u,multiply(a,multiply(multiplicative_inverse(a),u))),
inference(spm,[status(thm)],[c_0_42,c_0_51]) ).
cnf(c_0_56,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_multiplication]) ).
cnf(c_0_57,hypothesis,
( ~ defined(multiplicative_inverse(a))
| equalish(v,multiply(multiply(multiplicative_inverse(a),a),v)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_29]),c_0_26])]) ).
cnf(c_0_58,hypothesis,
( ~ defined(multiply(multiplicative_inverse(a),u))
| equalish(u,multiply(multiply(multiplicative_inverse(a),u),a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_26])]) ).
cnf(c_0_59,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(multiply(X1,X2)) ),
c_0_56 ).
cnf(c_0_60,hypothesis,
equalish(v,multiply(multiply(multiplicative_inverse(a),a),v)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_36]),c_0_26])]),c_0_32]) ).
cnf(c_0_61,hypothesis,
( ~ defined(multiplicative_inverse(a))
| equalish(u,multiply(multiply(multiplicative_inverse(a),u),a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40])]) ).
cnf(c_0_62,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(a),a),v),v),
inference(spm,[status(thm)],[c_0_42,c_0_60]) ).
cnf(c_0_63,hypothesis,
equalish(u,multiply(multiply(multiplicative_inverse(a),u),a)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_36]),c_0_26])]),c_0_32]) ).
cnf(c_0_64,hypothesis,
( ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),a),v))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_23,c_0_62]) ).
cnf(c_0_65,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(X1,additive_identity)
| equalish(multiply(multiplicative_inverse(X1),multiply(X2,X3)),multiply(multiply(multiplicative_inverse(X1),X2),X3)) ),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_66,hypothesis,
equalish(multiply(multiply(multiplicative_inverse(a),u),a),u),
inference(spm,[status(thm)],[c_0_42,c_0_63]) ).
cnf(c_0_67,hypothesis,
equalish(multiply(multiplicative_inverse(a),multiply(a,v)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_29]),c_0_26])]),c_0_32]) ).
cnf(c_0_68,hypothesis,
( ~ equalish(X1,multiply(multiply(multiplicative_inverse(a),u),a))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_23,c_0_66]) ).
cnf(c_0_69,hypothesis,
( ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(a,v)))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_23,c_0_67]) ).
cnf(c_0_70,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(X2,additive_identity)
| equalish(multiply(X1,multiplicative_inverse(X2)),multiply(multiplicative_inverse(X2),X1)) ),
inference(spm,[status(thm)],[c_0_45,c_0_36]) ).
cnf(c_0_71,negated_conjecture,
equalish(multiply(a,v),b),
multiply_equals_b_7 ).
cnf(c_0_72,hypothesis,
equalish(multiply(multiplicative_inverse(a),multiply(u,a)),u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_65]),c_0_26]),c_0_40])]),c_0_32]) ).
cnf(c_0_73,hypothesis,
( ~ defined(multiply(a,v))
| equalish(multiply(multiply(a,v),multiplicative_inverse(a)),v) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_26])]),c_0_32]) ).
cnf(c_0_74,negated_conjecture,
equalish(b,multiply(a,v)),
inference(spm,[status(thm)],[c_0_42,c_0_71]) ).
cnf(c_0_75,hypothesis,
( ~ equalish(X1,multiply(multiplicative_inverse(a),multiply(u,a)))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_23,c_0_72]) ).
cnf(c_0_76,hypothesis,
equalish(multiply(multiply(a,v),multiplicative_inverse(a)),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_59]),c_0_29]),c_0_26])]) ).
cnf(c_0_77,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(b,X1),multiply(multiply(a,v),X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_74]) ).
cnf(c_0_78,hypothesis,
( ~ defined(multiply(u,a))
| equalish(multiply(multiply(u,a),multiplicative_inverse(a)),u) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_70]),c_0_26])]),c_0_32]) ).
cnf(c_0_79,hypothesis,
( ~ equalish(X1,multiply(multiply(a,v),multiplicative_inverse(a)))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_23,c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(b,multiplicative_inverse(X1)),multiply(multiply(a,v),multiplicative_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_77,c_0_36]) ).
cnf(c_0_81,negated_conjecture,
equalish(multiply(a,u),b),
multiply_equals_b_6 ).
cnf(c_0_82,hypothesis,
equalish(multiply(multiply(u,a),multiplicative_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_59]),c_0_26]),c_0_40])]) ).
cnf(c_0_83,hypothesis,
equalish(multiply(b,multiplicative_inverse(a)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_26])]),c_0_32]) ).
cnf(c_0_84,negated_conjecture,
( ~ defined(X1)
| equalish(multiply(multiply(a,u),X1),multiply(b,X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_81]) ).
cnf(c_0_85,hypothesis,
( ~ equalish(X1,multiply(multiply(u,a),multiplicative_inverse(a)))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_23,c_0_82]) ).
cnf(c_0_86,plain,
( ~ defined(X3)
| ~ defined(X1)
| ~ defined(X2)
| equalish(X3,additive_identity)
| equalish(multiply(multiply(X1,X2),multiplicative_inverse(X3)),multiply(multiply(X2,X1),multiplicative_inverse(X3))) ),
inference(spm,[status(thm)],[c_0_49,c_0_36]) ).
cnf(c_0_87,hypothesis,
( ~ equalish(X1,multiply(b,multiplicative_inverse(a)))
| equalish(X1,v) ),
inference(spm,[status(thm)],[c_0_23,c_0_83]) ).
cnf(c_0_88,negated_conjecture,
( ~ defined(X1)
| equalish(X1,additive_identity)
| equalish(multiply(multiply(a,u),multiplicative_inverse(X1)),multiply(b,multiplicative_inverse(X1))) ),
inference(spm,[status(thm)],[c_0_84,c_0_36]) ).
cnf(c_0_89,hypothesis,
equalish(multiply(multiply(a,u),multiplicative_inverse(a)),u),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_40]),c_0_26])]),c_0_32]) ).
cnf(c_0_90,negated_conjecture,
equalish(multiply(multiply(a,u),multiplicative_inverse(a)),v),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_26])]),c_0_32]) ).
cnf(c_0_91,hypothesis,
( ~ equalish(X1,multiply(multiply(a,u),multiplicative_inverse(a)))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_23,c_0_89]) ).
cnf(c_0_92,negated_conjecture,
equalish(v,multiply(multiply(a,u),multiplicative_inverse(a))),
inference(spm,[status(thm)],[c_0_42,c_0_90]) ).
cnf(c_0_93,negated_conjecture,
~ equalish(u,v),
inference(fof_simplification,[status(thm)],[u_not_equal_to_v_8]) ).
cnf(c_0_94,hypothesis,
equalish(v,u),
inference(spm,[status(thm)],[c_0_91,c_0_92]) ).
cnf(c_0_95,negated_conjecture,
~ equalish(u,v),
c_0_93 ).
cnf(c_0_96,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_94]),c_0_95]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD028-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.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 15:38:59 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 19.31/3.37 % Version: 3.5.1
% 19.31/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 19.31/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 19.31/3.37 % Starting new_bool_3 with 300s (1) cores
% 19.31/3.37 % Starting new_bool_1 with 300s (1) cores
% 19.31/3.37 % Starting sh5l with 300s (1) cores
% 19.31/3.37 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2117181 completed with status 0
% 19.31/3.37 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 19.31/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 19.31/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 19.31/3.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.31/3.37 % No SInE strategy applied
% 19.31/3.37 % Search class: FGUNF-FFMM21-SFFFFFNN
% 19.31/3.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.31/3.37 % Starting SubtermCWHack with 136s (1) cores
% 19.31/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 19.31/3.37 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 19.31/3.37 % Starting new_bool_3 with 269s (1) cores
% 19.31/3.37 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 19.31/3.37 % G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with pid 2117192 completed with status 0
% 19.31/3.37 % Result found by G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN
% 19.31/3.37 % Preprocessing class: FSMSSMSSSSSNFFN.
% 19.31/3.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.31/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 19.31/3.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.31/3.37 % No SInE strategy applied
% 19.31/3.37 % Search class: FGUNF-FFMM21-SFFFFFNN
% 19.31/3.37 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 19.31/3.37 % Starting SubtermCWHack with 136s (1) cores
% 19.31/3.37 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 19.31/3.37 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 19.31/3.37 % Starting new_bool_3 with 269s (1) cores
% 19.31/3.37 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 19.31/3.37 % Preprocessing time : 0.002 s
% 19.31/3.37 % Presaturation interreduction done
% 19.31/3.37
% 19.31/3.37 % Proof found!
% 19.31/3.37 % SZS status Unsatisfiable
% 19.31/3.37 % SZS output start CNFRefutation
% See solution above
% 19.31/3.37 % Parsed axioms : 35
% 19.31/3.37 % Removed by relevancy pruning/SinE : 0
% 19.31/3.37 % Initial clauses : 35
% 19.31/3.37 % Removed in clause preprocessing : 0
% 19.31/3.37 % Initial clauses in saturation : 35
% 19.31/3.37 % Processed clauses : 14762
% 19.31/3.37 % ...of these trivial : 5080
% 19.31/3.37 % ...subsumed : 997
% 19.31/3.37 % ...remaining for further processing : 8685
% 19.31/3.37 % Other redundant clauses eliminated : 0
% 19.31/3.37 % Clauses deleted for lack of memory : 0
% 19.31/3.37 % Backward-subsumed : 5
% 19.31/3.37 % Backward-rewritten : 99
% 19.31/3.37 % Generated clauses : 149724
% 19.31/3.37 % ...of the previous two non-redundant : 125691
% 19.31/3.37 % ...aggressively subsumed : 0
% 19.31/3.37 % Contextual simplify-reflections : 11
% 19.31/3.37 % Paramodulations : 149716
% 19.31/3.37 % Factorizations : 8
% 19.31/3.37 % NegExts : 0
% 19.31/3.37 % Equation resolutions : 0
% 19.31/3.37 % Disequality decompositions : 0
% 19.31/3.37 % Total rewrite steps : 55508
% 19.31/3.37 % ...of those cached : 51177
% 19.31/3.37 % Propositional unsat checks : 0
% 19.31/3.37 % Propositional check models : 0
% 19.31/3.37 % Propositional check unsatisfiable : 0
% 19.31/3.37 % Propositional clauses : 0
% 19.31/3.37 % Propositional clauses after purity: 0
% 19.31/3.37 % Propositional unsat core size : 0
% 19.31/3.37 % Propositional preprocessing time : 0.000
% 19.31/3.37 % Propositional encoding time : 0.000
% 19.31/3.37 % Propositional solver time : 0.000
% 19.31/3.37 % Success case prop preproc time : 0.000
% 19.31/3.37 % Success case prop encoding time : 0.000
% 19.31/3.37 % Success case prop solver time : 0.000
% 19.31/3.37 % Current number of processed clauses : 8546
% 19.31/3.37 % Positive orientable unit clauses : 4513
% 19.31/3.37 % Positive unorientable unit clauses: 0
% 19.31/3.37 % Negative unit clauses : 3
% 19.31/3.37 % Non-unit-clauses : 4030
% 19.31/3.37 % Current number of unprocessed clauses: 110999
% 19.31/3.37 % ...number of literals in the above : 246788
% 19.31/3.37 % Current number of archived formulas : 0
% 19.31/3.37 % Current number of archived clauses : 139
% 19.31/3.37 % Clause-clause subsumption calls (NU) : 546520
% 19.31/3.37 % Rec. Clause-clause subsumption calls : 409978
% 19.31/3.37 % Non-unit clause-clause subsumptions : 1013
% 19.31/3.37 % Unit Clause-clause subsumption calls : 38612
% 19.31/3.37 % Rewrite failures with RHS unbound : 0
% 19.31/3.37 % BW rewrite match attempts : 20074
% 19.31/3.37 % BW rewrite match successes : 94
% 19.31/3.37 % Condensation attempts : 0
% 19.31/3.37 % Condensation successes : 0
% 19.31/3.37 % Termbank termtop insertions : 2366325
% 19.31/3.37 % Search garbage collected termcells : 73
% 19.31/3.37
% 19.31/3.37 % -------------------------------------------------
% 19.31/3.37 % User time : 2.430 s
% 19.31/3.37 % System time : 0.125 s
% 19.31/3.37 % Total time : 2.556 s
% 19.31/3.37 % Maximum resident set size: 3660 pages
% 19.31/3.37
% 19.31/3.37 % -------------------------------------------------
% 19.31/3.37 % User time : 13.120 s
% 19.31/3.37 % System time : 0.656 s
% 19.31/3.37 % Total time : 13.777 s
% 19.31/3.37 % Maximum resident set size: 4608 pages
% 19.31/3.37 % E exiting
%------------------------------------------------------------------------------