%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD055-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 : n018.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:20 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 28 ( 13 unt; 4 nHn; 28 RR)
% Number of literals : 56 ( 0 equ; 27 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
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(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(b_equals_c_5,negated_conjecture,
equalish(b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_equals_c_5) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(transitivity_of_order_relation,axiom,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_order_relation) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(c_0_8,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_9,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_10,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_11,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_8 ).
cnf(c_0_12,negated_conjecture,
equalish(b,c),
b_equals_c_5 ).
cnf(c_0_13,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_9 ).
cnf(c_0_14,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_15,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_10 ).
cnf(c_0_16,negated_conjecture,
equalish(c,b),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
( ~ defined(X1)
| less_or_equal(X1,c)
| less_or_equal(c,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_order_relation]) ).
cnf(c_0_19,negated_conjecture,
( ~ less_or_equal(c,X1)
| less_or_equal(b,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,hypothesis,
less_or_equal(c,c),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
~ less_or_equal(a,c),
inference(fof_simplification,[status(thm)],[not_less_or_equal_6]) ).
cnf(c_0_22,plain,
( ~ less_or_equal(X3,X2)
| ~ less_or_equal(X1,X3)
| less_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_23,hypothesis,
less_or_equal(b,c),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ less_or_equal(a,c),
c_0_21 ).
cnf(c_0_25,hypothesis,
( ~ less_or_equal(X1,b)
| less_or_equal(X1,c) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD055-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.10/5.38 % Computer : n018.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Mon Sep 21 15:44:35 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.43 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
% 0.15/5.45 % Version: 3.5.1
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.45 % Starting sh5l with 300s (1) cores
% 0.15/5.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2248377 completed with status 0
% 0.15/5.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/5.45 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.15/5.45 % Starting new_bool_3 with 269s (1) cores
% 0.15/5.45 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.15/5.45 % SubtermCWHack with pid 2248381 completed with status 0
% 0.15/5.45 % Result found by SubtermCWHack
% 0.15/5.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/5.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.45 % No SInE strategy applied
% 0.15/5.45 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.15/5.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.45 % Preprocessing time : 0.001 s
% 0.15/5.45
% 0.15/5.45 % Proof found!
% 0.15/5.45 % SZS status Unsatisfiable
% 0.15/5.45 % SZS output start CNFRefutation
% See solution above
% 0.15/5.45 % Parsed axioms : 33
% 0.15/5.45 % Removed by relevancy pruning/SinE : 0
% 0.15/5.45 % Initial clauses : 33
% 0.15/5.45 % Removed in clause preprocessing : 0
% 0.15/5.45 % Initial clauses in saturation : 33
% 0.15/5.45 % Processed clauses : 76
% 0.15/5.45 % ...of these trivial : 1
% 0.15/5.45 % ...subsumed : 5
% 0.15/5.45 % ...remaining for further processing : 70
% 0.15/5.45 % Other redundant clauses eliminated : 0
% 0.15/5.45 % Clauses deleted for lack of memory : 0
% 0.15/5.45 % Backward-subsumed : 0
% 0.15/5.45 % Backward-rewritten : 2
% 0.15/5.45 % Generated clauses : 182
% 0.15/5.45 % ...of the previous two non-redundant : 133
% 0.15/5.45 % ...aggressively subsumed : 0
% 0.15/5.45 % Contextual simplify-reflections : 0
% 0.15/5.45 % Paramodulations : 182
% 0.15/5.45 % Factorizations : 0
% 0.15/5.45 % NegExts : 0
% 0.15/5.45 % Equation resolutions : 0
% 0.15/5.45 % Disequality decompositions : 0
% 0.15/5.45 % Total rewrite steps : 46
% 0.15/5.45 % ...of those cached : 23
% 0.15/5.45 % Propositional unsat checks : 0
% 0.15/5.45 % Propositional check models : 0
% 0.15/5.45 % Propositional check unsatisfiable : 0
% 0.15/5.45 % Propositional clauses : 0
% 0.15/5.45 % Propositional clauses after purity: 0
% 0.15/5.45 % Propositional unsat core size : 0
% 0.15/5.45 % Propositional preprocessing time : 0.000
% 0.15/5.45 % Propositional encoding time : 0.000
% 0.15/5.45 % Propositional solver time : 0.000
% 0.15/5.45 % Success case prop preproc time : 0.000
% 0.15/5.45 % Success case prop encoding time : 0.000
% 0.15/5.45 % Success case prop solver time : 0.000
% 0.15/5.45 % Current number of processed clauses : 68
% 0.15/5.45 % Positive orientable unit clauses : 35
% 0.15/5.45 % Positive unorientable unit clauses: 0
% 0.15/5.45 % Negative unit clauses : 2
% 0.15/5.45 % Non-unit-clauses : 31
% 0.15/5.45 % Current number of unprocessed clauses: 90
% 0.15/5.45 % ...number of literals in the above : 243
% 0.15/5.45 % Current number of archived formulas : 0
% 0.15/5.45 % Current number of archived clauses : 2
% 0.15/5.45 % Clause-clause subsumption calls (NU) : 52
% 0.15/5.45 % Rec. Clause-clause subsumption calls : 48
% 0.15/5.45 % Non-unit clause-clause subsumptions : 4
% 0.15/5.45 % Unit Clause-clause subsumption calls : 14
% 0.15/5.45 % Rewrite failures with RHS unbound : 0
% 0.15/5.45 % BW rewrite match attempts : 2
% 0.15/5.45 % BW rewrite match successes : 2
% 0.15/5.45 % Condensation attempts : 0
% 0.15/5.45 % Condensation successes : 0
% 0.15/5.45 % Termbank termtop insertions : 2666
% 0.15/5.45 % Search garbage collected termcells : 71
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.005 s
% 0.15/5.45 % System time : 0.003 s
% 0.15/5.45 % Total time : 0.007 s
% 0.15/5.45 % Maximum resident set size: 3660 pages
% 0.15/5.45
% 0.15/5.45 % -------------------------------------------------
% 0.15/5.45 % User time : 0.016 s
% 0.15/5.45 % System time : 0.013 s
% 0.15/5.45 % Total time : 0.029 s
% 0.15/5.45 % Maximum resident set size: 4864 pages
% 0.15/5.45 % E exiting
%------------------------------------------------------------------------------