%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL024-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 : n019.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:34 PM UTC 2026
% Result : Unsatisfiable 3.30s 1.16s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 3
% Syntax : Number of clauses : 42 ( 16 unt; 0 nHn; 22 RR)
% Number of literals : 76 ( 0 equ; 37 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 98 ( 1 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(xgk,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xgk) ).
cnf(prove_pyo,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
file('/export/starexec/sandbox/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(X1,equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))),
xgk ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,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_4,c_0_6]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X2,X3))))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X1,X3)),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,X3))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_5]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X1,X2)),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X2,equivalent(X1,equivalent(X3,X3)))))),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_19]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X3)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X2,X1)),X3)),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X1,X2)))),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_26,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X1)),X2)),
inference(spm,[status(thm)],[c_0_23,c_0_25]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X1,equivalent(X3,X3)),X2)))),
inference(spm,[status(thm)],[c_0_14,c_0_26]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X1)))) ),
inference(spm,[status(thm)],[c_0_23,c_0_8]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,X1)),equivalent(X3,X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_27]) ).
cnf(c_0_31,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_7,c_0_28]) ).
cnf(c_0_32,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X2),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X3,equivalent(X2,X3)))))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X2,X1))),
inference(spm,[status(thm)],[c_0_34,c_0_5]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X2),X1))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_31,c_0_35]) ).
cnf(c_0_37,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_38,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X3,equivalent(X2,X1))))),
inference(spm,[status(thm)],[c_0_36,c_0_24]) ).
cnf(c_0_39,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))),
c_0_37 ).
cnf(c_0_40,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_5])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL024-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n019.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.45 % DateTime : Mon Sep 21 00:00:49 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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
% 3.30/1.16 % Version: 3.5.1
% 3.30/1.16 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.30/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.16 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.30/1.16 % Starting new_bool_3 with 300s (1) cores
% 3.30/1.16 % Starting new_bool_1 with 300s (1) cores
% 3.30/1.16 % Starting sh5l with 300s (1) cores
% 3.30/1.16 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1259630 completed with status 0
% 3.30/1.16 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.30/1.16 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.30/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.16 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.30/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.30/1.16 % No SInE strategy applied
% 3.30/1.16 % Search class: FHUNF-FFSF22-MFFFFFNN
% 3.30/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.30/1.16 % Starting SubtermCWHack with 136s (1) cores
% 3.30/1.16 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.30/1.16 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 3.30/1.16 % Starting new_bool_3 with 136s (1) cores
% 3.30/1.16 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.30/1.16 % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 1259634 completed with status 0
% 3.30/1.16 % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 3.30/1.16 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.30/1.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.30/1.16 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.30/1.16 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.30/1.16 % No SInE strategy applied
% 3.30/1.16 % Search class: FHUNF-FFSF22-MFFFFFNN
% 3.30/1.16 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.30/1.16 % Starting SubtermCWHack with 136s (1) cores
% 3.30/1.16 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.30/1.16 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 3.30/1.16 % Preprocessing time : 0.002 s
% 3.30/1.16
% 3.30/1.16 % Proof found!
% 3.30/1.16 % SZS status Unsatisfiable
% 3.30/1.16 % SZS output start CNFRefutation
% See solution above
% 3.30/1.16 % Parsed axioms : 3
% 3.30/1.16 % Removed by relevancy pruning/SinE : 0
% 3.30/1.16 % Initial clauses : 3
% 3.30/1.16 % Removed in clause preprocessing : 0
% 3.30/1.16 % Initial clauses in saturation : 3
% 3.30/1.16 % Processed clauses : 7119
% 3.30/1.16 % ...of these trivial : 908
% 3.30/1.16 % ...subsumed : 5624
% 3.30/1.16 % ...remaining for further processing : 587
% 3.30/1.16 % Other redundant clauses eliminated : 0
% 3.30/1.16 % Clauses deleted for lack of memory : 0
% 3.30/1.16 % Backward-subsumed : 0
% 3.30/1.16 % Backward-rewritten : 1
% 3.30/1.16 % Generated clauses : 37541
% 3.30/1.16 % ...of the previous two non-redundant : 20670
% 3.30/1.16 % ...aggressively subsumed : 0
% 3.30/1.16 % Contextual simplify-reflections : 0
% 3.30/1.16 % Paramodulations : 37541
% 3.30/1.16 % Factorizations : 0
% 3.30/1.16 % NegExts : 0
% 3.30/1.16 % Equation resolutions : 0
% 3.30/1.16 % Disequality decompositions : 0
% 3.30/1.16 % Total rewrite steps : 18410
% 3.30/1.16 % ...of those cached : 18071
% 3.30/1.16 % Propositional unsat checks : 0
% 3.30/1.16 % Propositional check models : 0
% 3.30/1.16 % Propositional check unsatisfiable : 0
% 3.30/1.16 % Propositional clauses : 0
% 3.30/1.16 % Propositional clauses after purity: 0
% 3.30/1.16 % Propositional unsat core size : 0
% 3.30/1.16 % Propositional preprocessing time : 0.000
% 3.30/1.16 % Propositional encoding time : 0.000
% 3.30/1.16 % Propositional solver time : 0.000
% 3.30/1.16 % Success case prop preproc time : 0.000
% 3.30/1.16 % Success case prop encoding time : 0.000
% 3.30/1.16 % Success case prop solver time : 0.000
% 3.30/1.16 % Current number of processed clauses : 586
% 3.30/1.16 % Positive orientable unit clauses : 327
% 3.30/1.16 % Positive unorientable unit clauses: 0
% 3.30/1.16 % Negative unit clauses : 1
% 3.30/1.16 % Non-unit-clauses : 258
% 3.30/1.16 % Current number of unprocessed clauses: 13477
% 3.30/1.16 % ...number of literals in the above : 22867
% 3.30/1.16 % Current number of archived formulas : 0
% 3.30/1.16 % Current number of archived clauses : 1
% 3.30/1.16 % Clause-clause subsumption calls (NU) : 117673
% 3.30/1.16 % Rec. Clause-clause subsumption calls : 117673
% 3.30/1.16 % Non-unit clause-clause subsumptions : 5624
% 3.30/1.16 % Unit Clause-clause subsumption calls : 573
% 3.30/1.16 % Rewrite failures with RHS unbound : 0
% 3.30/1.16 % BW rewrite match attempts : 54577
% 3.30/1.16 % BW rewrite match successes : 1
% 3.30/1.16 % Condensation attempts : 0
% 3.30/1.16 % Condensation successes : 0
% 3.30/1.16 % Termbank termtop insertions : 345073
% 3.30/1.16 % Search garbage collected termcells : 8
% 3.30/1.16
% 3.30/1.16 % -------------------------------------------------
% 3.30/1.16 % User time : 0.565 s
% 3.30/1.16 % System time : 0.014 s
% 3.30/1.16 % Total time : 0.579 s
% 3.30/1.16 % Maximum resident set size: 3376 pages
% 3.30/1.16
% 3.30/1.16 % -------------------------------------------------
% 3.30/1.16 % User time : 2.748 s
% 3.30/1.16 % System time : 0.121 s
% 3.30/1.16 % Total time : 2.868 s
% 3.30/1.16 % Maximum resident set size: 4864 pages
% 3.30/1.16 % E exiting
%------------------------------------------------------------------------------