%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL081-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 : n004.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:43 PM UTC 2026
% Result : Unsatisfiable 0.16s 5.45s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 33 ( 19 unt; 0 nHn; 8 RR)
% Number of literals : 51 ( 0 equ; 21 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 : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 89 ( 41 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ic_JLukasiewicz,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
cnf(prove_ic_1,negated_conjecture,
~ is_a_theorem(implies(a,a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_ic_1) ).
cnf(c_0_3,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(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(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
ic_JLukasiewicz ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(implies(X2,X4),X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X2,X4)),implies(X5,implies(X2,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(implies(implies(X4,X2),implies(X5,X2)),implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(implies(X4,X2),implies(X5,X2))),implies(X6,implies(implies(X4,X2),implies(X5,X2))))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X2),implies(implies(X3,X2),implies(X2,X2))))),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(implies(implies(X5,implies(X3,X6)),implies(implies(X2,X3),implies(X4,X3))))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X1),implies(implies(X2,X1),implies(X1,X1)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(X1,X1),implies(implies(X2,X1),implies(X1,X1)))),
inference(spm,[status(thm)],[c_0_12,c_0_5]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X2,X2))
| is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X2,X3))))),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(X1,X1))
| is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,implies(X1,X2))),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_18]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(implies(X3,X3))
| ~ is_a_theorem(implies(implies(X3,X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_19]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X3)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_25]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_5]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(a,a)),
inference(fof_simplification,[status(thm)],[prove_ic_1]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(implies(a,a)),
c_0_28 ).
cnf(c_0_31,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_29,c_0_5]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL081-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.13/5.38 % Computer : n004.cluster.edu
% 0.13/5.38 % Model : x86_64 x86_64
% 0.13/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.38 % Memory : 8046.5625MB
% 0.13/5.38 % OS : Linux 6.8.0-71-generic
% 0.13/5.39 % CPULimit : 300
% 0.13/5.39 % WCLimit : 300
% 0.13/5.39 % DateTime : Mon Sep 21 00:04:12 UTC 2026
% 0.13/5.39 % CPUTime :
% 0.13/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.43 Running first-order theorem proving
% 0.16/5.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.16/5.45 % Version: 3.5.1
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % Starting new_bool_1 with 300s (1) cores
% 0.16/5.45 % Starting sh5l with 300s (1) cores
% 0.16/5.45 % new_bool_3 with pid 1830381 completed with status 0
% 0.16/5.45 % Result found by new_bool_3
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % SubtermCWHack with pid 1830387 completed with status 0
% 0.16/5.45 % Result found by SubtermCWHack
% 0.16/5.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/5.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/5.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/5.45 % Starting new_bool_3 with 300s (1) cores
% 0.16/5.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/5.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/5.45 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.16/5.45 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/5.45 % Starting SubtermCWHack with 31s (1) cores
% 0.16/5.45 % Preprocessing time : 0.001 s
% 0.16/5.45
% 0.16/5.45 % Proof found!
% 0.16/5.45 % SZS status Unsatisfiable
% 0.16/5.45 % SZS output start CNFRefutation
% See solution above
% 0.16/5.46 % Parsed axioms : 3
% 0.16/5.46 % Removed by relevancy pruning/SinE : 0
% 0.16/5.46 % Initial clauses : 3
% 0.16/5.46 % Removed in clause preprocessing : 0
% 0.16/5.46 % Initial clauses in saturation : 3
% 0.16/5.46 % Processed clauses : 74
% 0.16/5.46 % ...of these trivial : 5
% 0.16/5.46 % ...subsumed : 20
% 0.16/5.46 % ...remaining for further processing : 49
% 0.16/5.46 % Other redundant clauses eliminated : 0
% 0.16/5.46 % Clauses deleted for lack of memory : 0
% 0.16/5.46 % Backward-subsumed : 7
% 0.16/5.46 % Backward-rewritten : 18
% 0.16/5.46 % Generated clauses : 323
% 0.16/5.46 % ...of the previous two non-redundant : 240
% 0.16/5.46 % ...aggressively subsumed : 0
% 0.16/5.46 % Contextual simplify-reflections : 0
% 0.16/5.46 % Paramodulations : 323
% 0.16/5.46 % Factorizations : 0
% 0.16/5.46 % NegExts : 0
% 0.16/5.46 % Equation resolutions : 0
% 0.16/5.46 % Disequality decompositions : 0
% 0.16/5.46 % Total rewrite steps : 110
% 0.16/5.46 % ...of those cached : 64
% 0.16/5.46 % Propositional unsat checks : 0
% 0.16/5.46 % Propositional check models : 0
% 0.16/5.46 % Propositional check unsatisfiable : 0
% 0.16/5.46 % Propositional clauses : 0
% 0.16/5.46 % Propositional clauses after purity: 0
% 0.16/5.46 % Propositional unsat core size : 0
% 0.16/5.46 % Propositional preprocessing time : 0.000
% 0.16/5.46 % Propositional encoding time : 0.000
% 0.16/5.46 % Propositional solver time : 0.000
% 0.16/5.46 % Success case prop preproc time : 0.000
% 0.16/5.46 % Success case prop encoding time : 0.000
% 0.16/5.46 % Success case prop solver time : 0.000
% 0.16/5.46 % Current number of processed clauses : 24
% 0.16/5.46 % Positive orientable unit clauses : 14
% 0.16/5.46 % Positive unorientable unit clauses: 0
% 0.16/5.46 % Negative unit clauses : 0
% 0.16/5.46 % Non-unit-clauses : 10
% 0.16/5.46 % Current number of unprocessed clauses: 118
% 0.16/5.46 % ...number of literals in the above : 218
% 0.16/5.46 % Current number of archived formulas : 0
% 0.16/5.46 % Current number of archived clauses : 25
% 0.16/5.46 % Clause-clause subsumption calls (NU) : 212
% 0.16/5.46 % Rec. Clause-clause subsumption calls : 212
% 0.16/5.46 % Non-unit clause-clause subsumptions : 24
% 0.16/5.46 % Unit Clause-clause subsumption calls : 61
% 0.16/5.46 % Rewrite failures with RHS unbound : 0
% 0.16/5.46 % BW rewrite match attempts : 308
% 0.16/5.46 % BW rewrite match successes : 18
% 0.16/5.46 % Condensation attempts : 0
% 0.16/5.46 % Condensation successes : 0
% 0.16/5.46 % Termbank termtop insertions : 4005
% 0.16/5.46 % Search garbage collected termcells : 8
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.006 s
% 0.16/5.46 % System time : 0.000 s
% 0.16/5.46 % Total time : 0.006 s
% 0.16/5.46 % Maximum resident set size: 3632 pages
% 0.16/5.46
% 0.16/5.46 % -------------------------------------------------
% 0.16/5.46 % User time : 0.008 s
% 0.16/5.46 % System time : 0.004 s
% 0.16/5.46 % Total time : 0.012 s
% 0.16/5.46 % Maximum resident set size: 4608 pages
% 0.16/5.46 % E exiting
%------------------------------------------------------------------------------