%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL128-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 01:18:33 PM UTC 2026
% Result : Unsatisfiable 3.40s 1.08s
% Output : CNFRefutation 3.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 3
% Syntax : Number of clauses : 35 ( 18 unt; 0 nHn; 14 RR)
% Number of literals : 57 ( 0 equ; 25 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 105 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(s_3,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',s_3) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_0_3,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))))),
s_3 ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,X4)))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(X4,equivalent(X1,X3)))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4))),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3))),equivalent(X1,equivalent(X2,X4)))),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)),X5)),X5))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X5,X3),X4)),equivalent(X2,X5)))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),equivalent(X2,X4)),X5)),X5)) ),
inference(spm,[status(thm)],[c_0_4,c_0_21]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X3)),X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X1,equivalent(X4,X3)),equivalent(X2,X4)))),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),equivalent(X3,X5)))))) ),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(fof_simplification,[status(thm)],[prove_lg_2]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X3,X4),equivalent(X5,X4)),equivalent(X3,X5)))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_27]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_17,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
c_0_29 ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL128-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n005.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.37 % DateTime : Mon Sep 21 00:06:18 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.45 Running first-order theorem proving
% 0.15/0.45 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
% 3.40/1.08 % Version: 3.5.1
% 3.40/1.08 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.40/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.40/1.08 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.40/1.08 % Starting new_bool_3 with 300s (1) cores
% 3.40/1.08 % Starting new_bool_1 with 300s (1) cores
% 3.40/1.08 % Starting sh5l with 300s (1) cores
% 3.40/1.08 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2117800 completed with status 0
% 3.40/1.08 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.40/1.08 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.40/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.40/1.08 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.40/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.40/1.08 % No SInE strategy applied
% 3.40/1.08 % Search class: FHUNF-FFSF22-MFFFFFNN
% 3.40/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.40/1.08 % Starting SubtermCWHack with 136s (1) cores
% 3.40/1.08 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.40/1.08 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 3.40/1.08 % Starting new_bool_3 with 136s (1) cores
% 3.40/1.08 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.40/1.08 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 2117810 completed with status 0
% 3.40/1.08 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 3.40/1.08 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.40/1.08 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.40/1.08 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.40/1.08 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.40/1.08 % No SInE strategy applied
% 3.40/1.08 % Search class: FHUNF-FFSF22-MFFFFFNN
% 3.40/1.08 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.40/1.08 % Starting SubtermCWHack with 136s (1) cores
% 3.40/1.08 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.40/1.08 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 3.40/1.08 % Starting new_bool_3 with 136s (1) cores
% 3.40/1.08 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.40/1.08 % Preprocessing time : 0.002 s
% 3.40/1.08 % Presaturation interreduction done
% 3.40/1.08
% 3.40/1.08 % Proof found!
% 3.40/1.08 % SZS status Unsatisfiable
% 3.40/1.08 % SZS output start CNFRefutation
% See solution above
% 3.40/1.08 % Parsed axioms : 3
% 3.40/1.08 % Removed by relevancy pruning/SinE : 0
% 3.40/1.08 % Initial clauses : 3
% 3.40/1.08 % Removed in clause preprocessing : 0
% 3.40/1.08 % Initial clauses in saturation : 3
% 3.40/1.08 % Processed clauses : 1275
% 3.40/1.08 % ...of these trivial : 98
% 3.40/1.08 % ...subsumed : 867
% 3.40/1.08 % ...remaining for further processing : 310
% 3.40/1.08 % Other redundant clauses eliminated : 0
% 3.40/1.08 % Clauses deleted for lack of memory : 0
% 3.40/1.08 % Backward-subsumed : 1
% 3.40/1.08 % Backward-rewritten : 4
% 3.40/1.08 % Generated clauses : 16639
% 3.40/1.08 % ...of the previous two non-redundant : 12139
% 3.40/1.08 % ...aggressively subsumed : 0
% 3.40/1.08 % Contextual simplify-reflections : 1
% 3.40/1.08 % Paramodulations : 16639
% 3.40/1.08 % Factorizations : 0
% 3.40/1.08 % NegExts : 0
% 3.40/1.08 % Equation resolutions : 0
% 3.40/1.08 % Disequality decompositions : 0
% 3.40/1.08 % Total rewrite steps : 5436
% 3.40/1.08 % ...of those cached : 5165
% 3.40/1.08 % Propositional unsat checks : 0
% 3.40/1.08 % Propositional check models : 0
% 3.40/1.08 % Propositional check unsatisfiable : 0
% 3.40/1.08 % Propositional clauses : 0
% 3.40/1.08 % Propositional clauses after purity: 0
% 3.40/1.08 % Propositional unsat core size : 0
% 3.40/1.08 % Propositional preprocessing time : 0.000
% 3.40/1.08 % Propositional encoding time : 0.000
% 3.40/1.08 % Propositional solver time : 0.000
% 3.40/1.08 % Success case prop preproc time : 0.000
% 3.40/1.08 % Success case prop encoding time : 0.000
% 3.40/1.08 % Success case prop solver time : 0.000
% 3.40/1.08 % Current number of processed clauses : 302
% 3.40/1.08 % Positive orientable unit clauses : 143
% 3.40/1.08 % Positive unorientable unit clauses: 0
% 3.40/1.08 % Negative unit clauses : 2
% 3.40/1.08 % Non-unit-clauses : 157
% 3.40/1.08 % Current number of unprocessed clauses: 10824
% 3.40/1.08 % ...number of literals in the above : 19058
% 3.40/1.08 % Current number of archived formulas : 0
% 3.40/1.08 % Current number of archived clauses : 8
% 3.40/1.08 % Clause-clause subsumption calls (NU) : 10753
% 3.40/1.08 % Rec. Clause-clause subsumption calls : 10753
% 3.40/1.08 % Non-unit clause-clause subsumptions : 869
% 3.40/1.08 % Unit Clause-clause subsumption calls : 1920
% 3.40/1.08 % Rewrite failures with RHS unbound : 0
% 3.40/1.08 % BW rewrite match attempts : 12920
% 3.40/1.08 % BW rewrite match successes : 4
% 3.40/1.08 % Condensation attempts : 0
% 3.40/1.08 % Condensation successes : 0
% 3.40/1.08 % Termbank termtop insertions : 222287
% 3.40/1.08 % Search garbage collected termcells : 8
% 3.40/1.08
% 3.40/1.08 % -------------------------------------------------
% 3.40/1.08 % User time : 0.372 s
% 3.40/1.08 % System time : 0.019 s
% 3.40/1.08 % Total time : 0.392 s
% 3.40/1.08 % Maximum resident set size: 3380 pages
% 3.40/1.08
% 3.40/1.08 % -------------------------------------------------
% 3.40/1.08 % User time : 2.231 s
% 3.40/1.08 % System time : 0.117 s
% 3.40/1.08 % Total time : 2.348 s
% 3.40/1.08 % Maximum resident set size: 4864 pages
% 3.40/1.08 % E exiting
%------------------------------------------------------------------------------