%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL083-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 : 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:11:43 PM UTC 2026
% Result : Unsatisfiable 0.03s 0.50s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 35 ( 23 unt; 0 nHn; 8 RR)
% Number of literals : 50 ( 0 equ; 18 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 : 112 ( 58 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,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X3,X1),implies(X4,X1)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ic_JLukasiewicz) ).
cnf(prove_ic_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ic_3) ).
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(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_9,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_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X3,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,X2),implies(X2,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(implies(X1,X2),implies(X2,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X2,X1))
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(X1,X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X4,implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),implies(X4,X2)),implies(X5,implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X4,implies(X3,X5)),implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_18]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X2,X3),X4),X3),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_5]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),implies(X4,X2)))),
inference(spm,[status(thm)],[c_0_9,c_0_5]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),X1),implies(X3,X1)),X4),implies(X5,X4))),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X3),X2),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_5]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X3,X4),X3),implies(X5,X3)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(implies(X1,X2),X3)),implies(X4,implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_6,c_0_24]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(implies(X3,X4),X3),X3)))),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_28,c_0_5]) ).
cnf(c_0_30,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
inference(fof_simplification,[status(thm)],[prove_ic_3]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(implies(X1,X2),X1),X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
c_0_30 ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_5]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL083-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n017.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 : Sun Sep 20 23:59:12 UTC 2026
% 0.10/0.39 % CPUTime :
% 0.10/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.46 Running first-order theorem proving
% 0.03/0.46 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.03/0.50 % Version: 3.5.1
% 0.03/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.50 % Starting sh5l with 300s (1) cores
% 0.03/0.50 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 977518 completed with status 0
% 0.03/0.50 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.03/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.03/0.50 % No SInE strategy applied
% 0.03/0.50 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.03/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.03/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.03/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.03/0.50 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.03/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.03/0.50 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.03/0.50 % U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 977529 completed with status 0
% 0.03/0.50 % Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.03/0.50 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.03/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.03/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.03/0.50 % No SInE strategy applied
% 0.03/0.50 % Search class: FHUNF-FFSF22-MFFFFFNN
% 0.03/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.03/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.03/0.50 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.03/0.50 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 0.03/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.03/0.50 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.03/0.50 % Preprocessing time : 0.001 s
% 0.03/0.50 % Presaturation interreduction done
% 0.03/0.50
% 0.03/0.50 % Proof found!
% 0.03/0.50 % SZS status Unsatisfiable
% 0.03/0.50 % SZS output start CNFRefutation
% See solution above
% 0.03/0.50 % Parsed axioms : 3
% 0.03/0.50 % Removed by relevancy pruning/SinE : 0
% 0.03/0.50 % Initial clauses : 3
% 0.03/0.50 % Removed in clause preprocessing : 0
% 0.03/0.50 % Initial clauses in saturation : 3
% 0.03/0.50 % Processed clauses : 218
% 0.03/0.50 % ...of these trivial : 20
% 0.03/0.50 % ...subsumed : 80
% 0.03/0.50 % ...remaining for further processing : 118
% 0.03/0.50 % Other redundant clauses eliminated : 0
% 0.03/0.50 % Clauses deleted for lack of memory : 0
% 0.03/0.50 % Backward-subsumed : 1
% 0.03/0.50 % Backward-rewritten : 25
% 0.03/0.50 % Generated clauses : 1641
% 0.03/0.50 % ...of the previous two non-redundant : 826
% 0.03/0.50 % ...aggressively subsumed : 0
% 0.03/0.50 % Contextual simplify-reflections : 0
% 0.03/0.50 % Paramodulations : 1641
% 0.03/0.50 % Factorizations : 0
% 0.03/0.50 % NegExts : 0
% 0.03/0.50 % Equation resolutions : 0
% 0.03/0.50 % Disequality decompositions : 0
% 0.03/0.50 % Total rewrite steps : 844
% 0.03/0.50 % ...of those cached : 697
% 0.03/0.50 % Propositional unsat checks : 0
% 0.03/0.50 % Propositional check models : 0
% 0.03/0.50 % Propositional check unsatisfiable : 0
% 0.03/0.50 % Propositional clauses : 0
% 0.03/0.50 % Propositional clauses after purity: 0
% 0.03/0.50 % Propositional unsat core size : 0
% 0.03/0.50 % Propositional preprocessing time : 0.000
% 0.03/0.50 % Propositional encoding time : 0.000
% 0.03/0.50 % Propositional solver time : 0.000
% 0.03/0.50 % Success case prop preproc time : 0.000
% 0.03/0.50 % Success case prop encoding time : 0.000
% 0.03/0.50 % Success case prop solver time : 0.000
% 0.03/0.50 % Current number of processed clauses : 89
% 0.03/0.50 % Positive orientable unit clauses : 62
% 0.03/0.50 % Positive unorientable unit clauses: 0
% 0.03/0.50 % Negative unit clauses : 1
% 0.03/0.50 % Non-unit-clauses : 26
% 0.03/0.50 % Current number of unprocessed clauses: 224
% 0.03/0.50 % ...number of literals in the above : 315
% 0.03/0.50 % Current number of archived formulas : 0
% 0.03/0.50 % Current number of archived clauses : 29
% 0.03/0.50 % Clause-clause subsumption calls (NU) : 479
% 0.03/0.50 % Rec. Clause-clause subsumption calls : 479
% 0.03/0.50 % Non-unit clause-clause subsumptions : 81
% 0.03/0.50 % Unit Clause-clause subsumption calls : 62
% 0.03/0.50 % Rewrite failures with RHS unbound : 0
% 0.03/0.50 % BW rewrite match attempts : 2231
% 0.03/0.50 % BW rewrite match successes : 25
% 0.03/0.50 % Condensation attempts : 0
% 0.03/0.50 % Condensation successes : 0
% 0.03/0.50 % Termbank termtop insertions : 17203
% 0.03/0.50 % Search garbage collected termcells : 8
% 0.03/0.50
% 0.03/0.50 % -------------------------------------------------
% 0.03/0.50 % User time : 0.021 s
% 0.03/0.50 % System time : 0.002 s
% 0.03/0.50 % Total time : 0.023 s
% 0.03/0.50 % Maximum resident set size: 3632 pages
% 0.03/0.50
% 0.03/0.50 % -------------------------------------------------
% 0.03/0.50 % User time : 0.082 s
% 0.03/0.50 % System time : 0.018 s
% 0.03/0.50 % Total time : 0.100 s
% 0.03/0.50 % Maximum resident set size: 4608 pages
% 0.03/0.50 % E exiting
%------------------------------------------------------------------------------