%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL103-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:11:46 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.59s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 4
% Syntax : Number of clauses : 33 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 60 ( 0 equ; 42 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 61 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(q_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
cnf(p_1,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_0_4,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_5,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
c_0_4 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)),
q_3 ).
cnf(c_0_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
p_1 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X2),X4))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4))) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
inference(fof_simplification,[status(thm)],[prove_lg_2]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),e),e)),
c_0_10 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(equivalent(X2,X4))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),X3))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
( ~ is_a_theorem(equivalent(e,X1))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(b,c)),X1),e)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(equivalent(e,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(a,c))),e))),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(e,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(a,c))),e))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(b,c),X1),e))
| ~ is_a_theorem(equivalent(e,equivalent(equivalent(equivalent(a,b),equivalent(a,c)),X1))) ),
inference(spm,[status(thm)],[c_0_19,c_0_9]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(equivalent(e,X1))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,c),X2),e))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(a,b),equivalent(a,c)),X2))) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),X2),X1))
| ~ is_a_theorem(equivalent(e,equivalent(equivalent(a,c),X2)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(b,c),X1),e)) ),
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(equivalent(e,equivalent(equivalent(a,c),X1)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,b),X1),equivalent(equivalent(c,b),e))) ),
inference(spm,[status(thm)],[c_0_22,c_0_6]) ).
cnf(c_0_24,negated_conjecture,
~ is_a_theorem(equivalent(e,equivalent(equivalent(a,c),equivalent(equivalent(b,a),equivalent(equivalent(c,b),e))))),
inference(spm,[status(thm)],[c_0_23,c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(e,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(a,c),equivalent(equivalent(b,a),equivalent(equivalent(c,b),e))))) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(equivalent(e,equivalent(equivalent(b,c),equivalent(equivalent(c,b),e)))),
inference(spm,[status(thm)],[c_0_25,c_0_7]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(equivalent(equivalent(X4,X3),X2))
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X4),X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_theorem(equivalent(e,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(c,b),e)))) ),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(e,equivalent(equivalent(c,c),e))),
inference(spm,[status(thm)],[c_0_28,c_0_7]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(spm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL103-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.51 % Computer : n003.cluster.edu
% 0.09/0.51 % Model : x86_64 x86_64
% 0.09/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.51 % Memory : 8046.5625MB
% 0.09/0.51 % OS : Linux 6.8.0-71-generic
% 0.09/0.51 % CPULimit : 300
% 0.09/0.51 % WCLimit : 300
% 0.09/0.51 % DateTime : Mon Sep 21 00:06:30 UTC 2026
% 0.09/0.51 % CPUTime :
% 0.09/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.55 Running first-order theorem proving
% 0.09/0.55 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.15/0.59 % Version: 3.5.1
% 0.15/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.59 % Starting sh5l with 300s (1) cores
% 0.15/0.59 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2973394 completed with status 0
% 0.15/0.59 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.59 % No SInE strategy applied
% 0.15/0.59 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.15/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.15/0.59 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.59 % G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 2973401 completed with status 0
% 0.15/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 0.15/0.59 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.59 % No SInE strategy applied
% 0.15/0.59 % Search class: FHUNS-FFSF22-MFFFFFNN
% 0.15/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.59 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 0.15/0.59 % Preprocessing time : 0.001 s
% 0.15/0.59 % Presaturation interreduction done
% 0.15/0.59
% 0.15/0.59 % Proof found!
% 0.15/0.59 % SZS status Unsatisfiable
% 0.15/0.59 % SZS output start CNFRefutation
% See solution above
% 0.15/0.59 % Parsed axioms : 4
% 0.15/0.59 % Removed by relevancy pruning/SinE : 0
% 0.15/0.59 % Initial clauses : 4
% 0.15/0.59 % Removed in clause preprocessing : 0
% 0.15/0.59 % Initial clauses in saturation : 4
% 0.15/0.59 % Processed clauses : 106
% 0.15/0.59 % ...of these trivial : 1
% 0.15/0.59 % ...subsumed : 41
% 0.15/0.59 % ...remaining for further processing : 64
% 0.15/0.59 % Other redundant clauses eliminated : 0
% 0.15/0.59 % Clauses deleted for lack of memory : 0
% 0.15/0.59 % Backward-subsumed : 2
% 0.15/0.59 % Backward-rewritten : 1
% 0.15/0.59 % Generated clauses : 484
% 0.15/0.59 % ...of the previous two non-redundant : 448
% 0.15/0.59 % ...aggressively subsumed : 0
% 0.15/0.59 % Contextual simplify-reflections : 0
% 0.15/0.59 % Paramodulations : 484
% 0.15/0.59 % Factorizations : 0
% 0.15/0.59 % NegExts : 0
% 0.15/0.59 % Equation resolutions : 0
% 0.15/0.59 % Disequality decompositions : 0
% 0.15/0.59 % Total rewrite steps : 5
% 0.15/0.59 % ...of those cached : 1
% 0.15/0.59 % Propositional unsat checks : 0
% 0.15/0.59 % Propositional check models : 0
% 0.15/0.59 % Propositional check unsatisfiable : 0
% 0.15/0.59 % Propositional clauses : 0
% 0.15/0.59 % Propositional clauses after purity: 0
% 0.15/0.59 % Propositional unsat core size : 0
% 0.15/0.59 % Propositional preprocessing time : 0.000
% 0.15/0.59 % Propositional encoding time : 0.000
% 0.15/0.59 % Propositional solver time : 0.000
% 0.15/0.59 % Success case prop preproc time : 0.000
% 0.15/0.59 % Success case prop encoding time : 0.000
% 0.15/0.59 % Success case prop solver time : 0.000
% 0.15/0.59 % Current number of processed clauses : 57
% 0.15/0.59 % Positive orientable unit clauses : 5
% 0.15/0.59 % Positive unorientable unit clauses: 0
% 0.15/0.59 % Negative unit clauses : 6
% 0.15/0.59 % Non-unit-clauses : 46
% 0.15/0.59 % Current number of unprocessed clauses: 350
% 0.15/0.59 % ...number of literals in the above : 1142
% 0.15/0.59 % Current number of archived formulas : 0
% 0.15/0.59 % Current number of archived clauses : 7
% 0.15/0.59 % Clause-clause subsumption calls (NU) : 882
% 0.15/0.59 % Rec. Clause-clause subsumption calls : 777
% 0.15/0.59 % Non-unit clause-clause subsumptions : 29
% 0.15/0.59 % Unit Clause-clause subsumption calls : 119
% 0.15/0.59 % Rewrite failures with RHS unbound : 0
% 0.15/0.59 % BW rewrite match attempts : 56
% 0.15/0.59 % BW rewrite match successes : 1
% 0.15/0.59 % Condensation attempts : 0
% 0.15/0.59 % Condensation successes : 0
% 0.15/0.59 % Termbank termtop insertions : 8346
% 0.15/0.59 % Search garbage collected termcells : 8
% 0.15/0.59
% 0.15/0.59 % -------------------------------------------------
% 0.15/0.59 % User time : 0.013 s
% 0.15/0.59 % System time : 0.005 s
% 0.15/0.59 % Total time : 0.018 s
% 0.15/0.59 % Maximum resident set size: 3636 pages
% 0.15/0.59
% 0.15/0.59 % -------------------------------------------------
% 0.15/0.59 % User time : 0.054 s
% 0.15/0.59 % System time : 0.020 s
% 0.15/0.59 % Total time : 0.075 s
% 0.15/0.59 % Maximum resident set size: 4864 pages
% 0.15/0.59 % E exiting
%------------------------------------------------------------------------------