%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL118-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 : n017.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:50 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.45s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 13 unt; 0 nHn; 11 RR)
% Number of literals : 41 ( 0 equ; 19 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 2 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(wo,axiom,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wo) ).
cnf(prove_yqm,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqm) ).
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(equivalent(X1,equivalent(X2,X3)),equivalent(X3,equivalent(X2,X1)))),
wo ).
cnf(c_0_6,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,equivalent(X1,X3))))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,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_9]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X3,X2)),X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X3,equivalent(X1,X2))))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_5]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(X3,X1))),equivalent(X3,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_20,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
inference(fof_simplification,[status(thm)],[prove_yqm]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,b),equivalent(c,a)))),
c_0_20 ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X3,X1)))),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL118-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.38 % Computer : n017.cluster.edu
% 0.12/0.38 % Model : x86_64 x86_64
% 0.12/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38 % Memory : 8046.5625MB
% 0.12/0.38 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 00:01:26 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.43 Running first-order theorem proving
% 0.12/0.43 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.12/0.45 % Version: 3.5.1
% 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.45 % Starting sh5l with 300s (1) cores
% 0.12/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 981556 completed with status 0
% 0.12/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.12/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.45 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.12/0.45 % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 981563 completed with status 0
% 0.12/0.45 % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 0.12/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.12/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.12/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.45 % No SInE strategy applied
% 0.12/0.45 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.12/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.12/0.45 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.12/0.45 % Preprocessing time : 0.001 s
% 0.12/0.45
% 0.12/0.45 % Proof found!
% 0.12/0.45 % SZS status Unsatisfiable
% 0.12/0.45 % SZS output start CNFRefutation
% See solution above
% 0.12/0.45 % Parsed axioms : 3
% 0.12/0.45 % Removed by relevancy pruning/SinE : 0
% 0.12/0.45 % Initial clauses : 3
% 0.12/0.45 % Removed in clause preprocessing : 0
% 0.12/0.45 % Initial clauses in saturation : 3
% 0.12/0.45 % Processed clauses : 68
% 0.12/0.45 % ...of these trivial : 0
% 0.12/0.45 % ...subsumed : 20
% 0.12/0.45 % ...remaining for further processing : 48
% 0.12/0.45 % Other redundant clauses eliminated : 0
% 0.12/0.45 % Clauses deleted for lack of memory : 0
% 0.12/0.45 % Backward-subsumed : 3
% 0.12/0.45 % Backward-rewritten : 4
% 0.12/0.45 % Generated clauses : 301
% 0.12/0.45 % ...of the previous two non-redundant : 199
% 0.12/0.45 % ...aggressively subsumed : 0
% 0.12/0.45 % Contextual simplify-reflections : 0
% 0.12/0.45 % Paramodulations : 301
% 0.12/0.45 % Factorizations : 0
% 0.12/0.45 % NegExts : 0
% 0.12/0.45 % Equation resolutions : 0
% 0.12/0.45 % Disequality decompositions : 0
% 0.12/0.45 % Total rewrite steps : 90
% 0.12/0.45 % ...of those cached : 64
% 0.12/0.45 % Propositional unsat checks : 0
% 0.12/0.45 % Propositional check models : 0
% 0.12/0.45 % Propositional check unsatisfiable : 0
% 0.12/0.45 % Propositional clauses : 0
% 0.12/0.45 % Propositional clauses after purity: 0
% 0.12/0.45 % Propositional unsat core size : 0
% 0.12/0.45 % Propositional preprocessing time : 0.000
% 0.12/0.45 % Propositional encoding time : 0.000
% 0.12/0.45 % Propositional solver time : 0.000
% 0.12/0.45 % Success case prop preproc time : 0.000
% 0.12/0.45 % Success case prop encoding time : 0.000
% 0.12/0.45 % Success case prop solver time : 0.000
% 0.12/0.45 % Current number of processed clauses : 41
% 0.12/0.45 % Positive orientable unit clauses : 24
% 0.12/0.45 % Positive unorientable unit clauses: 0
% 0.12/0.45 % Negative unit clauses : 0
% 0.12/0.45 % Non-unit-clauses : 17
% 0.12/0.45 % Current number of unprocessed clauses: 126
% 0.12/0.45 % ...number of literals in the above : 251
% 0.12/0.45 % Current number of archived formulas : 0
% 0.12/0.45 % Current number of archived clauses : 7
% 0.12/0.45 % Clause-clause subsumption calls (NU) : 144
% 0.12/0.45 % Rec. Clause-clause subsumption calls : 144
% 0.12/0.45 % Non-unit clause-clause subsumptions : 23
% 0.12/0.45 % Unit Clause-clause subsumption calls : 34
% 0.12/0.45 % Rewrite failures with RHS unbound : 0
% 0.12/0.45 % BW rewrite match attempts : 288
% 0.12/0.45 % BW rewrite match successes : 4
% 0.12/0.45 % Condensation attempts : 0
% 0.12/0.45 % Condensation successes : 0
% 0.12/0.45 % Termbank termtop insertions : 3290
% 0.12/0.45 % Search garbage collected termcells : 8
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.005 s
% 0.12/0.45 % System time : 0.004 s
% 0.12/0.45 % Total time : 0.010 s
% 0.12/0.45 % Maximum resident set size: 3580 pages
% 0.12/0.45
% 0.12/0.45 % -------------------------------------------------
% 0.12/0.45 % User time : 0.026 s
% 0.12/0.45 % System time : 0.022 s
% 0.12/0.45 % Total time : 0.048 s
% 0.12/0.45 % Maximum resident set size: 4864 pages
% 0.12/0.45 % E exiting
%------------------------------------------------------------------------------