%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL099-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 : n010.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:45 PM UTC 2026
% Result : Unsatisfiable 8.43s 4.66s
% Output : CNFRefutation 8.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of clauses : 45 ( 28 unt; 0 nHn; 18 RR)
% Number of literals : 67 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 143 ( 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(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).
cnf(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
cnf(prove_lg_5,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_5) ).
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(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)),
lg_3 ).
cnf(c_0_7,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X5),equivalent(equivalent(X3,X4),X5)),X1))
| is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)),
lg_2 ).
cnf(c_0_9,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(pm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)),X1))
| is_a_theorem(X1) ),
inference(pm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))),
inference(pm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))),
inference(pm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(pm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X2),X4))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4))) ),
inference(pm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(pm,[status(thm)],[c_0_5,c_0_12]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(pm,[status(thm)],[c_0_5,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(equivalent(X2,X4))
| ~ is_a_theorem(equivalent(equivalent(X1,X4),X3))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(pm,[status(thm)],[c_0_5,c_0_14]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(equivalent(X5,X1),equivalent(X5,X2)),X3),X4))),
inference(pm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(equivalent(X1,X4))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),equivalent(X3,X2)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(pm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))),
inference(pm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X4))),X5),equivalent(equivalent(X3,X4),X5))),
inference(pm,[status(thm)],[c_0_7,c_0_18]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(X1,X1)),
inference(pm,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3))) ),
inference(pm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),equivalent(equivalent(X5,X3),equivalent(equivalent(X1,equivalent(X2,X5)),X4)))),
inference(pm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
inference(fof_simplification,[status(thm)],[prove_lg_5]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))),
inference(pm,[status(thm)],[c_0_15,c_0_22]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X3),X1),X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(pm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X5,equivalent(X1,X4)),equivalent(X5,X3))))),
inference(pm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),equivalent(equivalent(e,a),falsehood)),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))),
c_0_25 ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))),
inference(pm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))),
inference(pm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X4,equivalent(X3,X2)),equivalent(X4,X1))))),
inference(pm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),X1))
| ~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,a),c)),X1),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))) ),
inference(pm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),X4))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4)) ),
inference(pm,[status(thm)],[c_0_5,c_0_30]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X4,X2),equivalent(X4,X3))))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(pm,[status(thm)],[c_0_5,c_0_31]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(equivalent(X4,X3),X1))))),
inference(pm,[status(thm)],[c_0_16,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),equivalent(a,X1)))
| ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(b,a),c),X1),equivalent(equivalent(equivalent(equivalent(a,b),e),c),falsehood))) ),
inference(pm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))),
inference(pm,[status(thm)],[c_0_35,c_0_30]) ).
cnf(c_0_39,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(equivalent(X2,X4),X1),equivalent(X4,X3)))),
inference(pm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(equivalent(X2,equivalent(X4,X3)),X1))))),
inference(pm,[status(thm)],[c_0_16,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(e,a),falsehood),equivalent(a,equivalent(equivalent(equivalent(equivalent(a,b),e),equivalent(b,a)),falsehood)))),
inference(pm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X1,X4)))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,X4))) ),
inference(pm,[status(thm)],[c_0_5,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(equivalent(X3,X4),X2),equivalent(X4,X3)),X1)))),
inference(pm,[status(thm)],[c_0_35,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL099-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n010.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 00:05:11 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 8.43/4.66 % Version: 3.5.1
% 8.43/4.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.43/4.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.43/4.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.43/4.66 % Starting new_bool_3 with 300s (1) cores
% 8.43/4.66 % Starting new_bool_1 with 300s (1) cores
% 8.43/4.66 % Starting sh5l with 300s (1) cores
% 8.43/4.66 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3833553 completed with status 0
% 8.43/4.66 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 8.43/4.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.43/4.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.43/4.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.43/4.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.43/4.66 % No SInE strategy applied
% 8.43/4.66 % Search class: FHUNS-FFSF22-DFFFFFNN
% 8.43/4.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.43/4.66 % Starting SubtermCWHack with 136s (1) cores
% 8.43/4.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.43/4.66 % Starting G-E--_300_C01_S5PRR_S00 with 136s (1) cores
% 8.43/4.66 % Starting new_bool_3 with 136s (1) cores
% 8.43/4.66 % Starting new_bool_1 with 136s (1) cores
% 8.43/4.66 % G-E--_300_C01_S5PRR_S00 with pid 3833561 completed with status 0
% 8.43/4.66 % Result found by G-E--_300_C01_S5PRR_S00
% 8.43/4.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 8.43/4.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.43/4.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 8.43/4.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 8.43/4.66 % No SInE strategy applied
% 8.43/4.66 % Search class: FHUNS-FFSF22-DFFFFFNN
% 8.43/4.66 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 8.43/4.66 % Starting SubtermCWHack with 136s (1) cores
% 8.43/4.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 8.43/4.66 % Starting G-E--_300_C01_S5PRR_S00 with 136s (1) cores
% 8.43/4.66 % Preprocessing time : 0.001 s
% 8.43/4.66
% 8.43/4.66 % Proof found!
% 8.43/4.66 % SZS status Unsatisfiable
% 8.43/4.66 % SZS output start CNFRefutation
% See solution above
% 8.43/4.66 % Parsed axioms : 4
% 8.43/4.66 % Removed by relevancy pruning/SinE : 0
% 8.43/4.66 % Initial clauses : 4
% 8.43/4.66 % Removed in clause preprocessing : 0
% 8.43/4.66 % Initial clauses in saturation : 4
% 8.43/4.66 % Processed clauses : 6123
% 8.43/4.66 % ...of these trivial : 544
% 8.43/4.66 % ...subsumed : 4358
% 8.43/4.66 % ...remaining for further processing : 1221
% 8.43/4.66 % Other redundant clauses eliminated : 0
% 8.43/4.66 % Clauses deleted for lack of memory : 0
% 8.43/4.66 % Backward-subsumed : 7
% 8.43/4.66 % Backward-rewritten : 3
% 8.43/4.66 % Generated clauses : 194782
% 8.43/4.66 % ...of the previous two non-redundant : 184779
% 8.43/4.66 % ...aggressively subsumed : 0
% 8.43/4.66 % Contextual simplify-reflections : 0
% 8.43/4.66 % Paramodulations : 194782
% 8.43/4.66 % Factorizations : 0
% 8.43/4.66 % NegExts : 0
% 8.43/4.66 % Equation resolutions : 0
% 8.43/4.66 % Disequality decompositions : 0
% 8.43/4.66 % Total rewrite steps : 15659
% 8.43/4.66 % ...of those cached : 14508
% 8.43/4.66 % Propositional unsat checks : 0
% 8.43/4.66 % Propositional check models : 0
% 8.43/4.66 % Propositional check unsatisfiable : 0
% 8.43/4.66 % Propositional clauses : 0
% 8.43/4.66 % Propositional clauses after purity: 0
% 8.43/4.66 % Propositional unsat core size : 0
% 8.43/4.66 % Propositional preprocessing time : 0.000
% 8.43/4.66 % Propositional encoding time : 0.000
% 8.43/4.66 % Propositional solver time : 0.000
% 8.43/4.66 % Success case prop preproc time : 0.000
% 8.43/4.66 % Success case prop encoding time : 0.000
% 8.43/4.66 % Success case prop solver time : 0.000
% 8.43/4.66 % Current number of processed clauses : 1211
% 8.43/4.66 % Positive orientable unit clauses : 513
% 8.43/4.66 % Positive unorientable unit clauses: 0
% 8.43/4.66 % Negative unit clauses : 5
% 8.43/4.66 % Non-unit-clauses : 693
% 8.43/4.66 % Current number of unprocessed clauses: 178630
% 8.43/4.66 % ...number of literals in the above : 549961
% 8.43/4.66 % Current number of archived formulas : 0
% 8.43/4.66 % Current number of archived clauses : 10
% 8.43/4.66 % Clause-clause subsumption calls (NU) : 139439
% 8.43/4.66 % Rec. Clause-clause subsumption calls : 37055
% 8.43/4.66 % Non-unit clause-clause subsumptions : 4362
% 8.43/4.66 % Unit Clause-clause subsumption calls : 12326
% 8.43/4.66 % Rewrite failures with RHS unbound : 0
% 8.43/4.66 % BW rewrite match attempts : 162354
% 8.43/4.66 % BW rewrite match successes : 3
% 8.43/4.66 % Condensation attempts : 0
% 8.43/4.66 % Condensation successes : 0
% 8.43/4.66 % Termbank termtop insertions : 2531551
% 8.43/4.66 % Search garbage collected termcells : 8
% 8.43/4.66
% 8.43/4.66 % -------------------------------------------------
% 8.43/4.66 % User time : 3.875 s
% 8.43/4.66 % System time : 0.161 s
% 8.43/4.66 % Total time : 4.036 s
% 8.43/4.66 % Maximum resident set size: 3636 pages
% 8.43/4.66
% 8.43/4.66 % -------------------------------------------------
% 8.43/4.66 % User time : 19.596 s
% 8.43/4.66 % System time : 0.816 s
% 8.43/4.66 % Total time : 20.413 s
% 8.43/4.66 % Maximum resident set size: 4608 pages
% 8.43/4.66 % E exiting
%------------------------------------------------------------------------------