%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL012-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 : n001.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:32 PM UTC 2026
% Result : Unsatisfiable 4.24s 1.05s
% Output : CNFRefutation 4.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 54 ( 21 unt; 0 nHn; 26 RR)
% Number of literals : 98 ( 0 equ; 47 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 : 138 ( 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(um,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(X3,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',um) ).
cnf(prove_yqj,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_yqj) ).
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,X2),X3),equivalent(X2,equivalent(X3,X1)))),
um ).
cnf(c_0_6,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X1),X2))
| 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(X1,equivalent(equivalent(X2,equivalent(X1,X3)),equivalent(X3,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,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_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X1),X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),X2),X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X2),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_7]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X3))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X2),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(X2,X2))) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,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_20,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X1),X3),X3))) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X3,X2),X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_20]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X3),X1))
| is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X1),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X2)),X3),X3)),
inference(spm,[status(thm)],[c_0_25,c_0_5]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X3,X1),X2))),
inference(spm,[status(thm)],[c_0_30,c_0_5]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(X2,X3),X2),X1),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_31]) ).
cnf(c_0_34,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(X2,X3),X1),X3))),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X3,X1),X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_36,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X2),equivalent(X3,X1))),
inference(spm,[status(thm)],[c_0_30,c_0_34]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(X1,X2)))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_10]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X3),X1))) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),X3),X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_39]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(equivalent(X3,X2),X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_5]) ).
cnf(c_0_43,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_44,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X2),equivalent(X1,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_40]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_41]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),X3)),equivalent(X2,X3))),
inference(spm,[status(thm)],[c_0_37,c_0_42]) ).
cnf(c_0_47,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X1)),X3),X2)),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
inference(fof_simplification,[status(thm)],[prove_yqj]) ).
cnf(c_0_49,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),X2))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X1),equivalent(X3,X2))),X3)),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,b),equivalent(equivalent(c,a),equivalent(b,c)))),
c_0_48 ).
cnf(c_0_52,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL012-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.10/0.36 % Computer : n001.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 00:05:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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
% 4.24/1.05 % Version: 3.5.1
% 4.24/1.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.24/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.24/1.05 % Starting new_bool_3 with 300s (1) cores
% 4.24/1.05 % Starting new_bool_1 with 300s (1) cores
% 4.24/1.05 % Starting sh5l with 300s (1) cores
% 4.24/1.05 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1771484 completed with status 0
% 4.24/1.05 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 4.24/1.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.24/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.24/1.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.24/1.05 % No SInE strategy applied
% 4.24/1.05 % Search class: FHUNF-FFSF22-MFFFFFNN
% 4.24/1.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.05 % Starting SubtermCWHack with 136s (1) cores
% 4.24/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.24/1.05 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 4.24/1.05 % Starting new_bool_3 with 136s (1) cores
% 4.24/1.05 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 4.24/1.05 % G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with pid 1771492 completed with status 0
% 4.24/1.05 % Result found by G-E--_060_C18_F1_PI_AE_CS_SP_S0Y
% 4.24/1.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 4.24/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 4.24/1.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.24/1.05 % No SInE strategy applied
% 4.24/1.05 % Search class: FHUNF-FFSF22-MFFFFFNN
% 4.24/1.05 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.05 % Starting SubtermCWHack with 136s (1) cores
% 4.24/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 4.24/1.05 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 4.24/1.05 % Preprocessing time : 0.001 s
% 4.24/1.05
% 4.24/1.05 % Proof found!
% 4.24/1.05 % SZS status Unsatisfiable
% 4.24/1.05 % SZS output start CNFRefutation
% See solution above
% 4.24/1.05 % Parsed axioms : 3
% 4.24/1.05 % Removed by relevancy pruning/SinE : 0
% 4.24/1.05 % Initial clauses : 3
% 4.24/1.05 % Removed in clause preprocessing : 0
% 4.24/1.05 % Initial clauses in saturation : 3
% 4.24/1.05 % Processed clauses : 10204
% 4.24/1.05 % ...of these trivial : 717
% 4.24/1.05 % ...subsumed : 8634
% 4.24/1.05 % ...remaining for further processing : 853
% 4.24/1.05 % Other redundant clauses eliminated : 0
% 4.24/1.05 % Clauses deleted for lack of memory : 0
% 4.24/1.05 % Backward-subsumed : 1
% 4.24/1.05 % Backward-rewritten : 1
% 4.24/1.05 % Generated clauses : 62165
% 4.24/1.05 % ...of the previous two non-redundant : 34368
% 4.24/1.05 % ...aggressively subsumed : 0
% 4.24/1.05 % Contextual simplify-reflections : 0
% 4.24/1.05 % Paramodulations : 62165
% 4.24/1.05 % Factorizations : 0
% 4.24/1.05 % NegExts : 0
% 4.24/1.05 % Equation resolutions : 0
% 4.24/1.05 % Disequality decompositions : 0
% 4.24/1.05 % Total rewrite steps : 28901
% 4.24/1.05 % ...of those cached : 28319
% 4.24/1.05 % Propositional unsat checks : 0
% 4.24/1.05 % Propositional check models : 0
% 4.24/1.05 % Propositional check unsatisfiable : 0
% 4.24/1.05 % Propositional clauses : 0
% 4.24/1.05 % Propositional clauses after purity: 0
% 4.24/1.05 % Propositional unsat core size : 0
% 4.24/1.05 % Propositional preprocessing time : 0.000
% 4.24/1.05 % Propositional encoding time : 0.000
% 4.24/1.05 % Propositional solver time : 0.000
% 4.24/1.05 % Success case prop preproc time : 0.000
% 4.24/1.05 % Success case prop encoding time : 0.000
% 4.24/1.05 % Success case prop solver time : 0.000
% 4.24/1.05 % Current number of processed clauses : 851
% 4.24/1.05 % Positive orientable unit clauses : 536
% 4.24/1.05 % Positive unorientable unit clauses: 0
% 4.24/1.05 % Negative unit clauses : 0
% 4.24/1.05 % Non-unit-clauses : 315
% 4.24/1.05 % Current number of unprocessed clauses: 24161
% 4.24/1.05 % ...number of literals in the above : 44785
% 4.24/1.05 % Current number of archived formulas : 0
% 4.24/1.05 % Current number of archived clauses : 2
% 4.24/1.05 % Clause-clause subsumption calls (NU) : 268821
% 4.24/1.05 % Rec. Clause-clause subsumption calls : 268821
% 4.24/1.05 % Non-unit clause-clause subsumptions : 8635
% 4.24/1.05 % Unit Clause-clause subsumption calls : 615
% 4.24/1.05 % Rewrite failures with RHS unbound : 0
% 4.24/1.05 % BW rewrite match attempts : 126376
% 4.24/1.05 % BW rewrite match successes : 1
% 4.24/1.05 % Condensation attempts : 0
% 4.24/1.05 % Condensation successes : 0
% 4.24/1.05 % Termbank termtop insertions : 574682
% 4.24/1.05 % Search garbage collected termcells : 8
% 4.24/1.05
% 4.24/1.05 % -------------------------------------------------
% 4.24/1.05 % User time : 0.581 s
% 4.24/1.05 % System time : 0.021 s
% 4.24/1.05 % Total time : 0.602 s
% 4.24/1.05 % Maximum resident set size: 3376 pages
% 4.24/1.05
% 4.24/1.05 % -------------------------------------------------
% 4.24/1.05 % User time : 2.807 s
% 4.24/1.05 % System time : 0.113 s
% 4.24/1.05 % Total time : 2.919 s
% 4.24/1.05 % Maximum resident set size: 4608 pages
% 4.24/1.05 % E exiting
%------------------------------------------------------------------------------