%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.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:19:24 PM UTC 2026
% Result : Unsatisfiable 0.28s 0.60s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 8 unt; 0 nHn; 20 RR)
% Number of literals : 81 ( 0 equ; 50 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 82 ( 4 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(xcb,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',xcb) ).
cnf(prove_reflexivity,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_reflexivity) ).
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(equivalent(X1,X2),equivalent(X3,X2)),X3))),
xcb ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X1,X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X3,X1),X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(X2,X1),X3),equivalent(X4,X3)),X4))) ),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),X4),equivalent(X3,X4))) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,equivalent(X3,X1)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_6]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X2,equivalent(equivalent(equivalent(X1,X3),equivalent(X4,X3)),X4)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_5]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(equivalent(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(X3)
| 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(X2)
| is_a_theorem(equivalent(equivalent(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_19]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X2,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_8]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_5]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X2,equivalent(X1,X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_21]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))) ),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_6]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_5]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
inference(fof_simplification,[status(thm)],[prove_reflexivity]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(equivalent(X1,X1)) ),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
~ is_a_theorem(equivalent(a,a)),
c_0_29 ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n017.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 00:24:56 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.51 Running first-order theorem proving
% 0.17/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
% 0.28/0.60 % Version: 3.5.1
% 0.28/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.28/0.60 % Starting sh5l with 300s (1) cores
% 0.28/0.60 % new_bool_3 with pid 1020561 completed with status 0
% 0.28/0.60 % Result found by new_bool_3
% 0.28/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.60 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.28/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.60 % SubtermCWHack with pid 1020567 completed with status 0
% 0.28/0.60 % Result found by SubtermCWHack
% 0.28/0.60 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.28/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.60 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.28/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.28/0.60 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.60 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.60 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.28/0.60 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.60 % Starting SubtermCWHack with 31s (1) cores
% 0.28/0.60 % Preprocessing time : 0.002 s
% 0.28/0.60
% 0.28/0.60 % Proof found!
% 0.28/0.60 % SZS status Unsatisfiable
% 0.28/0.60 % SZS output start CNFRefutation
% See solution above
% 0.28/0.60 % Parsed axioms : 3
% 0.28/0.60 % Removed by relevancy pruning/SinE : 0
% 0.28/0.60 % Initial clauses : 3
% 0.28/0.60 % Removed in clause preprocessing : 0
% 0.28/0.60 % Initial clauses in saturation : 3
% 0.28/0.60 % Processed clauses : 321
% 0.28/0.60 % ...of these trivial : 0
% 0.28/0.60 % ...subsumed : 207
% 0.28/0.60 % ...remaining for further processing : 114
% 0.28/0.60 % Other redundant clauses eliminated : 0
% 0.28/0.60 % Clauses deleted for lack of memory : 0
% 0.28/0.60 % Backward-subsumed : 3
% 0.28/0.60 % Backward-rewritten : 4
% 0.28/0.60 % Generated clauses : 2560
% 0.28/0.60 % ...of the previous two non-redundant : 2347
% 0.28/0.60 % ...aggressively subsumed : 0
% 0.28/0.60 % Contextual simplify-reflections : 0
% 0.28/0.60 % Paramodulations : 2560
% 0.28/0.60 % Factorizations : 0
% 0.28/0.60 % NegExts : 0
% 0.28/0.60 % Equation resolutions : 0
% 0.28/0.60 % Disequality decompositions : 0
% 0.28/0.60 % Total rewrite steps : 5
% 0.28/0.60 % ...of those cached : 1
% 0.28/0.60 % Propositional unsat checks : 0
% 0.28/0.60 % Propositional check models : 0
% 0.28/0.60 % Propositional check unsatisfiable : 0
% 0.28/0.60 % Propositional clauses : 0
% 0.28/0.60 % Propositional clauses after purity: 0
% 0.28/0.60 % Propositional unsat core size : 0
% 0.28/0.60 % Propositional preprocessing time : 0.000
% 0.28/0.60 % Propositional encoding time : 0.000
% 0.28/0.60 % Propositional solver time : 0.000
% 0.28/0.60 % Success case prop preproc time : 0.000
% 0.28/0.60 % Success case prop encoding time : 0.000
% 0.28/0.60 % Success case prop solver time : 0.000
% 0.28/0.60 % Current number of processed clauses : 107
% 0.28/0.60 % Positive orientable unit clauses : 2
% 0.28/0.60 % Positive unorientable unit clauses: 0
% 0.28/0.60 % Negative unit clauses : 1
% 0.28/0.60 % Non-unit-clauses : 104
% 0.28/0.60 % Current number of unprocessed clauses: 1969
% 0.28/0.60 % ...number of literals in the above : 8334
% 0.28/0.60 % Current number of archived formulas : 0
% 0.28/0.60 % Current number of archived clauses : 7
% 0.28/0.60 % Clause-clause subsumption calls (NU) : 4023
% 0.28/0.60 % Rec. Clause-clause subsumption calls : 3411
% 0.28/0.60 % Non-unit clause-clause subsumptions : 210
% 0.28/0.60 % Unit Clause-clause subsumption calls : 106
% 0.28/0.60 % Rewrite failures with RHS unbound : 0
% 0.28/0.60 % BW rewrite match attempts : 91
% 0.28/0.60 % BW rewrite match successes : 4
% 0.28/0.60 % Condensation attempts : 0
% 0.28/0.60 % Condensation successes : 0
% 0.28/0.60 % Termbank termtop insertions : 38296
% 0.28/0.60 % Search garbage collected termcells : 8
% 0.28/0.60
% 0.28/0.60 % -------------------------------------------------
% 0.28/0.60 % User time : 0.038 s
% 0.28/0.60 % System time : 0.006 s
% 0.28/0.60 % Total time : 0.044 s
% 0.28/0.60 % Maximum resident set size: 3632 pages
% 0.28/0.60
% 0.28/0.60 % -------------------------------------------------
% 0.28/0.60 % User time : 0.040 s
% 0.28/0.60 % System time : 0.012 s
% 0.28/0.60 % Total time : 0.052 s
% 0.28/0.60 % Maximum resident set size: 4864 pages
% 0.28/0.60 % E exiting
%------------------------------------------------------------------------------