%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL091-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 : n011.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:44 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 38 ( 24 unt; 0 nHn; 7 RR)
% Number of literals : 55 ( 0 equ; 20 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 : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 157 ( 95 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(ic_JLukasiewicz_5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz_5) ).
cnf(prove_ic_2,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_2) ).
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),implies(X3,X4)),implies(implies(X4,X1),implies(X5,implies(X3,X1))))),
ic_JLukasiewicz_5 ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(implies(X2,X5),implies(X4,X1)))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X4,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X3,X4)),implies(X5,implies(implies(X6,X3),implies(X3,X4))))),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(implies(X5,implies(X6,X3)),implies(X3,X4)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_7]) ).
cnf(c_0_9,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(implies(X4,X5),implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X5)
| is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X5,X2))),implies(X6,implies(X7,implies(X4,implies(X5,X2)))))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(implies(X3,X4),implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_13,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,implies(X3,X4))),implies(implies(X5,X4),implies(X4,X6))),implies(X7,implies(X8,implies(implies(X5,X4),implies(X4,X6)))))),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(implies(X6,implies(X7,implies(X8,X4))),implies(implies(X3,X4),implies(X4,X5))))
| is_a_theorem(implies(X1,implies(X2,implies(implies(X3,X4),implies(X4,X5))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_13]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,implies(X4,implies(X5,X3)))))),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X4),implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X5)
| is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(X5)
| is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X3),implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(X5,implies(X3,X4)))),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,implies(X4,X1))),implies(X5,implies(X6,implies(X3,implies(X4,X1)))))),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_23,c_0_5]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(implies(X5,X6),implies(X3,implies(X4,X5))))
| is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X5))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,X2)),implies(X4,implies(X2,implies(X3,X2))))),
inference(spm,[status(thm)],[c_0_6,c_0_25]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,implies(X5,X4)))))),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(X5)
| is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_28]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X3))))),
inference(spm,[status(thm)],[c_0_29,c_0_5]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_30]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_31,c_0_5]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
inference(fof_simplification,[status(thm)],[prove_ic_2]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ is_a_theorem(implies(a,implies(b,a))),
c_0_33 ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_34,c_0_5]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL091-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.10/0.38 % Computer : n011.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 00:04:26 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.48 % Version: 3.5.1
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 % Starting sh5l with 300s (1) cores
% 0.15/0.48 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 537994 completed with status 0
% 0.15/0.48 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.48 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.48 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 538006 completed with status 0
% 0.15/0.48 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.48 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.48 % No SInE strategy applied
% 0.15/0.48 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.15/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.48 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.48 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.15/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.48 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.48 % Preprocessing time : 0.001 s
% 0.15/0.48 % Presaturation interreduction done
% 0.15/0.48
% 0.15/0.48 % Proof found!
% 0.15/0.48 % SZS status Unsatisfiable
% 0.15/0.48 % SZS output start CNFRefutation
% See solution above
% 0.15/0.48 % Parsed axioms : 3
% 0.15/0.48 % Removed by relevancy pruning/SinE : 0
% 0.15/0.48 % Initial clauses : 3
% 0.15/0.48 % Removed in clause preprocessing : 0
% 0.15/0.48 % Initial clauses in saturation : 3
% 0.15/0.48 % Processed clauses : 184
% 0.15/0.48 % ...of these trivial : 24
% 0.15/0.48 % ...subsumed : 32
% 0.15/0.48 % ...remaining for further processing : 128
% 0.15/0.48 % Other redundant clauses eliminated : 0
% 0.15/0.48 % Clauses deleted for lack of memory : 0
% 0.15/0.48 % Backward-subsumed : 8
% 0.15/0.48 % Backward-rewritten : 57
% 0.15/0.48 % Generated clauses : 1346
% 0.15/0.48 % ...of the previous two non-redundant : 1057
% 0.15/0.48 % ...aggressively subsumed : 0
% 0.15/0.48 % Contextual simplify-reflections : 0
% 0.15/0.48 % Paramodulations : 1346
% 0.15/0.48 % Factorizations : 0
% 0.15/0.48 % NegExts : 0
% 0.15/0.48 % Equation resolutions : 0
% 0.15/0.48 % Disequality decompositions : 0
% 0.15/0.48 % Total rewrite steps : 381
% 0.15/0.48 % ...of those cached : 135
% 0.15/0.48 % Propositional unsat checks : 0
% 0.15/0.48 % Propositional check models : 0
% 0.15/0.48 % Propositional check unsatisfiable : 0
% 0.15/0.48 % Propositional clauses : 0
% 0.15/0.48 % Propositional clauses after purity: 0
% 0.15/0.48 % Propositional unsat core size : 0
% 0.15/0.48 % Propositional preprocessing time : 0.000
% 0.15/0.48 % Propositional encoding time : 0.000
% 0.15/0.48 % Propositional solver time : 0.000
% 0.15/0.48 % Success case prop preproc time : 0.000
% 0.15/0.48 % Success case prop encoding time : 0.000
% 0.15/0.48 % Success case prop solver time : 0.000
% 0.15/0.48 % Current number of processed clauses : 60
% 0.15/0.48 % Positive orientable unit clauses : 41
% 0.15/0.48 % Positive unorientable unit clauses: 0
% 0.15/0.48 % Negative unit clauses : 2
% 0.15/0.48 % Non-unit-clauses : 17
% 0.15/0.48 % Current number of unprocessed clauses: 408
% 0.15/0.48 % ...number of literals in the above : 566
% 0.15/0.48 % Current number of archived formulas : 0
% 0.15/0.48 % Current number of archived clauses : 68
% 0.15/0.48 % Clause-clause subsumption calls (NU) : 363
% 0.15/0.48 % Rec. Clause-clause subsumption calls : 363
% 0.15/0.48 % Non-unit clause-clause subsumptions : 39
% 0.15/0.48 % Unit Clause-clause subsumption calls : 80
% 0.15/0.48 % Rewrite failures with RHS unbound : 0
% 0.15/0.48 % BW rewrite match attempts : 2815
% 0.15/0.48 % BW rewrite match successes : 57
% 0.15/0.48 % Condensation attempts : 0
% 0.15/0.48 % Condensation successes : 0
% 0.15/0.48 % Termbank termtop insertions : 23428
% 0.15/0.48 % Search garbage collected termcells : 8
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.027 s
% 0.15/0.48 % System time : 0.003 s
% 0.15/0.48 % Total time : 0.030 s
% 0.15/0.48 % Maximum resident set size: 3632 pages
% 0.15/0.48
% 0.15/0.48 % -------------------------------------------------
% 0.15/0.48 % User time : 0.143 s
% 0.15/0.48 % System time : 0.022 s
% 0.15/0.48 % Total time : 0.165 s
% 0.15/0.48 % Maximum resident set size: 4864 pages
% 0.15/0.48 % E exiting
%------------------------------------------------------------------------------