%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL018-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 : n014.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:33 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.46s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 35 ( 16 unt; 0 nHn; 17 RR)
% Number of literals : 66 ( 0 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 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 : 87 ( 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(pym,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X3,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pym) ).
cnf(prove_pyo,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_pyo) ).
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(equivalent(X1,equivalent(X2,X3)),X2),equivalent(X3,X1))),
pym ).
cnf(c_0_6,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X3,X2),X1),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X3),X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),X2))) ),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X3,X1),X2),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_7]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X1),X3)) ),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X3),X2)),X3)),
inference(spm,[status(thm)],[c_0_19,c_0_7]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X1,X2),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,equivalent(X3,X1)),X3),X2))),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_5]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X2),X1),X3)),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),equivalent(X3,X2)),X3))),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),X2),X3)),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_28]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
inference(fof_simplification,[status(thm)],[prove_pyo]) ).
cnf(c_0_31,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,equivalent(X1,X3)),X3))),
inference(spm,[status(thm)],[c_0_25,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
c_0_30 ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X3),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_19,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 : LCL018-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.11/0.37 % Computer : n014.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:00:05 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.46 % Version: 3.5.1
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.46 % Starting sh5l with 300s (1) cores
% 0.11/0.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2718031 completed with status 0
% 0.11/0.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46 % No SInE strategy applied
% 0.11/0.46 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.46 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.11/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.46 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.11/0.46 % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 2718039 completed with status 0
% 0.11/0.46 % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 0.11/0.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.46 % No SInE strategy applied
% 0.11/0.46 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.11/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.46 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.11/0.46 % Preprocessing time : 0.001 s
% 0.11/0.46
% 0.11/0.46 % Proof found!
% 0.11/0.46 % SZS status Unsatisfiable
% 0.11/0.46 % SZS output start CNFRefutation
% See solution above
% 0.11/0.46 % Parsed axioms : 3
% 0.11/0.46 % Removed by relevancy pruning/SinE : 0
% 0.11/0.46 % Initial clauses : 3
% 0.11/0.46 % Removed in clause preprocessing : 0
% 0.11/0.46 % Initial clauses in saturation : 3
% 0.11/0.46 % Processed clauses : 370
% 0.11/0.46 % ...of these trivial : 32
% 0.11/0.46 % ...subsumed : 110
% 0.11/0.46 % ...remaining for further processing : 228
% 0.11/0.46 % Other redundant clauses eliminated : 0
% 0.11/0.46 % Clauses deleted for lack of memory : 0
% 0.11/0.46 % Backward-subsumed : 2
% 0.11/0.46 % Backward-rewritten : 2
% 0.11/0.46 % Generated clauses : 2451
% 0.11/0.46 % ...of the previous two non-redundant : 1575
% 0.11/0.46 % ...aggressively subsumed : 0
% 0.11/0.46 % Contextual simplify-reflections : 0
% 0.11/0.47 % Paramodulations : 2451
% 0.11/0.47 % Factorizations : 0
% 0.11/0.47 % NegExts : 0
% 0.11/0.47 % Equation resolutions : 0
% 0.11/0.47 % Disequality decompositions : 0
% 0.11/0.47 % Total rewrite steps : 957
% 0.11/0.47 % ...of those cached : 799
% 0.11/0.47 % Propositional unsat checks : 0
% 0.11/0.47 % Propositional check models : 0
% 0.11/0.47 % Propositional check unsatisfiable : 0
% 0.11/0.47 % Propositional clauses : 0
% 0.11/0.47 % Propositional clauses after purity: 0
% 0.11/0.47 % Propositional unsat core size : 0
% 0.11/0.47 % Propositional preprocessing time : 0.000
% 0.11/0.47 % Propositional encoding time : 0.000
% 0.11/0.47 % Propositional solver time : 0.000
% 0.11/0.47 % Success case prop preproc time : 0.000
% 0.11/0.47 % Success case prop encoding time : 0.000
% 0.11/0.47 % Success case prop solver time : 0.000
% 0.11/0.47 % Current number of processed clauses : 224
% 0.11/0.47 % Positive orientable unit clauses : 194
% 0.11/0.47 % Positive unorientable unit clauses: 0
% 0.11/0.47 % Negative unit clauses : 0
% 0.11/0.47 % Non-unit-clauses : 30
% 0.11/0.47 % Current number of unprocessed clauses: 1195
% 0.11/0.47 % ...number of literals in the above : 2736
% 0.11/0.47 % Current number of archived formulas : 0
% 0.11/0.47 % Current number of archived clauses : 4
% 0.11/0.47 % Clause-clause subsumption calls (NU) : 506
% 0.11/0.47 % Rec. Clause-clause subsumption calls : 499
% 0.11/0.47 % Non-unit clause-clause subsumptions : 112
% 0.11/0.47 % Unit Clause-clause subsumption calls : 87
% 0.11/0.47 % Rewrite failures with RHS unbound : 0
% 0.11/0.47 % BW rewrite match attempts : 10780
% 0.11/0.47 % BW rewrite match successes : 2
% 0.11/0.47 % Condensation attempts : 0
% 0.11/0.47 % Condensation successes : 0
% 0.11/0.47 % Termbank termtop insertions : 25993
% 0.11/0.47 % Search garbage collected termcells : 8
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.031 s
% 0.11/0.47 % System time : 0.007 s
% 0.11/0.47 % Total time : 0.038 s
% 0.11/0.47 % Maximum resident set size: 3632 pages
% 0.11/0.47
% 0.11/0.47 % -------------------------------------------------
% 0.11/0.47 % User time : 0.162 s
% 0.11/0.47 % System time : 0.028 s
% 0.11/0.47 % Total time : 0.190 s
% 0.11/0.47 % Maximum resident set size: 4864 pages
% 0.11/0.47 % E exiting
%------------------------------------------------------------------------------