%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD030-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:23:13 PM UTC 2026
% Result : Unsatisfiable 0.21s 5.55s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 15 RR)
% Number of literals : 24 ( 0 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(multiply_not_equal_to_multiply_5,negated_conjecture,
~ equalish(multiply(d,b),multiply(a,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_not_equal_to_multiply_5) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(a_equals_d_4,negated_conjecture,
equalish(a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_d_4) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(c_0_5,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_6,negated_conjecture,
~ equalish(multiply(d,b),multiply(a,b)),
inference(fof_simplification,[status(thm)],[multiply_not_equal_to_multiply_5]) ).
cnf(c_0_7,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_8,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_5 ).
cnf(c_0_9,negated_conjecture,
equalish(a,d),
a_equals_d_4 ).
cnf(c_0_10,negated_conjecture,
~ equalish(multiply(d,b),multiply(a,b)),
c_0_6 ).
cnf(c_0_11,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(multiply(X1,X2),multiply(X3,X2)) ),
c_0_7 ).
cnf(c_0_12,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_13,negated_conjecture,
equalish(d,a),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : FLD030-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/5.48 % Computer : n008.cluster.edu
% 0.17/5.48 % Model : x86_64 x86_64
% 0.17/5.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/5.48 % Memory : 8046.5625MB
% 0.17/5.48 % OS : Linux 6.8.0-71-generic
% 0.17/5.48 % CPULimit : 300
% 0.17/5.48 % WCLimit : 300
% 0.17/5.48 % DateTime : Mon Sep 21 15:39:31 UTC 2026
% 0.17/5.48 % CPUTime :
% 0.17/5.48 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/5.53 Running first-order theorem proving
% 0.21/5.53 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.21/5.55 % Version: 3.5.1
% 0.21/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.21/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.21/5.55 % Starting sh5l with 300s (1) cores
% 0.21/5.55 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1326232 completed with status 0
% 0.21/5.55 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.55 % No SInE strategy applied
% 0.21/5.55 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/5.55 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.21/5.55 % Starting new_bool_3 with 269s (1) cores
% 0.21/5.55 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.21/5.55 % SubtermCWHack with pid 1326236 completed with status 0
% 0.21/5.55 % Result found by SubtermCWHack
% 0.21/5.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/5.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/5.55 % No SInE strategy applied
% 0.21/5.55 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.21/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.21/5.55 % Preprocessing time : 0.001 s
% 0.21/5.55
% 0.21/5.55 % Proof found!
% 0.21/5.55 % SZS status Unsatisfiable
% 0.21/5.55 % SZS output start CNFRefutation
% See solution above
% 0.21/5.55 % Parsed axioms : 32
% 0.21/5.55 % Removed by relevancy pruning/SinE : 0
% 0.21/5.55 % Initial clauses : 32
% 0.21/5.55 % Removed in clause preprocessing : 0
% 0.21/5.55 % Initial clauses in saturation : 32
% 0.21/5.55 % Processed clauses : 132
% 0.21/5.55 % ...of these trivial : 1
% 0.21/5.55 % ...subsumed : 17
% 0.21/5.55 % ...remaining for further processing : 114
% 0.21/5.55 % Other redundant clauses eliminated : 0
% 0.21/5.55 % Clauses deleted for lack of memory : 0
% 0.21/5.55 % Backward-subsumed : 0
% 0.21/5.55 % Backward-rewritten : 1
% 0.21/5.55 % Generated clauses : 351
% 0.21/5.55 % ...of the previous two non-redundant : 259
% 0.21/5.55 % ...aggressively subsumed : 0
% 0.21/5.55 % Contextual simplify-reflections : 0
% 0.21/5.55 % Paramodulations : 351
% 0.21/5.55 % Factorizations : 0
% 0.21/5.55 % NegExts : 0
% 0.21/5.55 % Equation resolutions : 0
% 0.21/5.55 % Disequality decompositions : 0
% 0.21/5.55 % Total rewrite steps : 87
% 0.21/5.55 % ...of those cached : 51
% 0.21/5.55 % Propositional unsat checks : 0
% 0.21/5.55 % Propositional check models : 0
% 0.21/5.55 % Propositional check unsatisfiable : 0
% 0.21/5.55 % Propositional clauses : 0
% 0.21/5.55 % Propositional clauses after purity: 0
% 0.21/5.55 % Propositional unsat core size : 0
% 0.21/5.55 % Propositional preprocessing time : 0.000
% 0.21/5.55 % Propositional encoding time : 0.000
% 0.21/5.55 % Propositional solver time : 0.000
% 0.21/5.55 % Success case prop preproc time : 0.000
% 0.21/5.55 % Success case prop encoding time : 0.000
% 0.21/5.55 % Success case prop solver time : 0.000
% 0.21/5.55 % Current number of processed clauses : 113
% 0.21/5.55 % Positive orientable unit clauses : 46
% 0.21/5.55 % Positive unorientable unit clauses: 0
% 0.21/5.55 % Negative unit clauses : 2
% 0.21/5.55 % Non-unit-clauses : 65
% 0.21/5.55 % Current number of unprocessed clauses: 152
% 0.21/5.55 % ...number of literals in the above : 438
% 0.21/5.55 % Current number of archived formulas : 0
% 0.21/5.55 % Current number of archived clauses : 1
% 0.21/5.55 % Clause-clause subsumption calls (NU) : 536
% 0.21/5.55 % Rec. Clause-clause subsumption calls : 500
% 0.21/5.55 % Non-unit clause-clause subsumptions : 17
% 0.21/5.55 % Unit Clause-clause subsumption calls : 192
% 0.21/5.55 % Rewrite failures with RHS unbound : 0
% 0.21/5.55 % BW rewrite match attempts : 1
% 0.21/5.55 % BW rewrite match successes : 1
% 0.21/5.55 % Condensation attempts : 0
% 0.21/5.55 % Condensation successes : 0
% 0.21/5.55 % Termbank termtop insertions : 4565
% 0.21/5.55 % Search garbage collected termcells : 71
% 0.21/5.55
% 0.21/5.55 % -------------------------------------------------
% 0.21/5.55 % User time : 0.006 s
% 0.21/5.55 % System time : 0.003 s
% 0.21/5.55 % Total time : 0.009 s
% 0.21/5.55 % Maximum resident set size: 3660 pages
% 0.21/5.55
% 0.21/5.55 % -------------------------------------------------
% 0.21/5.55 % User time : 0.027 s
% 0.21/5.55 % System time : 0.011 s
% 0.21/5.55 % Total time : 0.039 s
% 0.21/5.55 % Maximum resident set size: 4864 pages
% 0.21/5.55 % E exiting
%------------------------------------------------------------------------------