%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL034-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 : n009.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:35 PM UTC 2026
% Result : Unsatisfiable 1.42s 0.71s
% Output : CNFRefutation 1.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 3
% Syntax : Number of clauses : 50 ( 29 unt; 0 nHn; 13 RR)
% Number of literals : 75 ( 0 equ; 28 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 146 ( 78 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(c0_CAMeredith,axiom,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_CAMeredith) ).
cnf(prove_c0_3,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_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(implies(implies(X1,X2),implies(X3,falsehood)),X4),X5),implies(implies(X5,X1),implies(X3,X1)))),
c0_CAMeredith ).
cnf(c_0_6,plain,
( ~ is_a_theorem(implies(implies(implies(implies(X2,X4),implies(X3,falsehood)),X5),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(falsehood,X2)),X3),implies(X4,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(implies(X3,implies(falsehood,X4)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
is_a_theorem(implies(X1,implies(X2,implies(falsehood,X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(falsehood,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_10]) ).
cnf(c_0_12,plain,
is_a_theorem(implies(X1,implies(falsehood,X2))),
inference(spm,[status(thm)],[c_0_11,c_0_5]) ).
cnf(c_0_13,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_14,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),X2),implies(X3,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(X2)
| is_a_theorem(implies(falsehood,X1)) ),
inference(spm,[status(thm)],[c_0_4,c_0_11]) ).
cnf(c_0_16,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(falsehood,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_5]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(X1,implies(X2,X1))) ),
inference(spm,[status(thm)],[c_0_4,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(falsehood,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_5]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(implies(X2,X3),implies(X4,falsehood)),X5)),X2),implies(X4,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_20]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(implies(X2,X4),implies(X1,falsehood)),X3))),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_23,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X4))
| is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),X4)) ),
inference(spm,[status(thm)],[c_0_4,c_0_22]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(implies(X3,implies(implies(implies(X2,X4),implies(X1,falsehood)),X5)),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_21]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X4,X1))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(implies(implies(implies(X2,X3),X4),implies(X1,falsehood)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X3,falsehood)),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_30,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X2),implies(X4,X2))),
inference(spm,[status(thm)],[c_0_6,c_0_29]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_30]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(implies(implies(implies(X1,falsehood),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_6,c_0_31]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(implies(implies(X2,X3),implies(X1,falsehood)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_29]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(implies(implies(implies(X1,falsehood),X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_32]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(implies(X1,falsehood),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_32]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(X1,implies(implies(implies(implies(X1,falsehood),X2),falsehood),X3))),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
is_a_theorem(implies(implies(implies(implies(implies(X1,X2),falsehood),X3),falsehood),X1)),
inference(spm,[status(thm)],[c_0_33,c_0_36]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(X1,X2)))),
inference(spm,[status(thm)],[c_0_6,c_0_37]) ).
cnf(c_0_39,plain,
( ~ is_a_theorem(implies(X2,implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_4,c_0_38]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(implies(implies(falsehood,X2),X3),X3))),
inference(spm,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(implies(falsehood,X1),X2),X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_40]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_41,c_0_19]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(X3,X1))),
inference(spm,[status(thm)],[c_0_6,c_0_32]) ).
cnf(c_0_44,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
inference(fof_simplification,[status(thm)],[prove_c0_3]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(implies(implies(falsehood,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_42]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X2),X2))),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,b),a),a)),
c_0_44 ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL034-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.32 % Computer : n009.cluster.edu
% 0.08/0.32 % Model : x86_64 x86_64
% 0.08/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.32 % Memory : 8046.5625MB
% 0.08/0.32 % OS : Linux 6.8.0-71-generic
% 0.08/0.32 % CPULimit : 300
% 0.08/0.32 % WCLimit : 300
% 0.08/0.32 % DateTime : Mon Sep 21 00:01:13 UTC 2026
% 0.08/0.32 % CPUTime :
% 0.08/0.33 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 Running first-order theorem proving
% 0.13/0.38 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
% 1.42/0.70 % Version: 3.5.1
% 1.42/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.42/0.70 % Starting new_bool_3 with 300s (1) cores
% 1.42/0.70 % Starting new_bool_1 with 300s (1) cores
% 1.42/0.70 % Starting sh5l with 300s (1) cores
% 1.42/0.70 % new_bool_3 with pid 407019 completed with status 9
% 1.42/0.70 % new_bool_1 with pid 407020 completed with status 9
% 1.42/0.70 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 407018 completed with status 0
% 1.42/0.70 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.42/0.70 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.42/0.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.42/0.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.42/0.70 % No SInE strategy applied
% 1.42/0.70 % Search class: FHUNF-FFSF22-MFFFFFNN
% 1.42/0.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.70 % Starting SubtermCWHack with 136s (1) cores
% 1.42/0.70 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.42/0.70 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 1.42/0.71 % Starting new_bool_3 with 136s (1) cores
% 1.42/0.71 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1.42/0.71 % new_bool_3 with pid 407027 completed with status 0
% 1.42/0.71 % Result found by new_bool_3
% 1.42/0.71 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.42/0.71 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.42/0.71 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.42/0.71 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.42/0.71 % No SInE strategy applied
% 1.42/0.71 % Search class: FHUNF-FFSF22-MFFFFFNN
% 1.42/0.71 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.42/0.71 % Starting SubtermCWHack with 136s (1) cores
% 1.42/0.71 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.42/0.71 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 1.42/0.71 % Starting new_bool_3 with 136s (1) cores
% 1.42/0.71 % Preprocessing time : 0.001 s
% 1.42/0.71 % Presaturation interreduction done
% 1.42/0.71
% 1.42/0.71 % Proof found!
% 1.42/0.71 % SZS status Unsatisfiable
% 1.42/0.71 % SZS output start CNFRefutation
% See solution above
% 1.42/0.71 % Parsed axioms : 3
% 1.42/0.71 % Removed by relevancy pruning/SinE : 0
% 1.42/0.71 % Initial clauses : 3
% 1.42/0.71 % Removed in clause preprocessing : 0
% 1.42/0.71 % Initial clauses in saturation : 3
% 1.42/0.71 % Processed clauses : 2577
% 1.42/0.71 % ...of these trivial : 467
% 1.42/0.71 % ...subsumed : 1686
% 1.42/0.71 % ...remaining for further processing : 424
% 1.42/0.71 % Other redundant clauses eliminated : 0
% 1.42/0.71 % Clauses deleted for lack of memory : 0
% 1.42/0.71 % Backward-subsumed : 45
% 1.42/0.71 % Backward-rewritten : 16
% 1.42/0.71 % Generated clauses : 23802
% 1.42/0.71 % ...of the previous two non-redundant : 18448
% 1.42/0.71 % ...aggressively subsumed : 0
% 1.42/0.71 % Contextual simplify-reflections : 0
% 1.42/0.71 % Paramodulations : 23802
% 1.42/0.71 % Factorizations : 0
% 1.42/0.71 % NegExts : 0
% 1.42/0.71 % Equation resolutions : 0
% 1.42/0.71 % Disequality decompositions : 0
% 1.42/0.71 % Total rewrite steps : 5717
% 1.42/0.71 % ...of those cached : 5326
% 1.42/0.71 % Propositional unsat checks : 0
% 1.42/0.71 % Propositional check models : 0
% 1.42/0.71 % Propositional check unsatisfiable : 0
% 1.42/0.71 % Propositional clauses : 0
% 1.42/0.71 % Propositional clauses after purity: 0
% 1.42/0.71 % Propositional unsat core size : 0
% 1.42/0.71 % Propositional preprocessing time : 0.000
% 1.42/0.71 % Propositional encoding time : 0.000
% 1.42/0.71 % Propositional solver time : 0.000
% 1.42/0.71 % Success case prop preproc time : 0.000
% 1.42/0.71 % Success case prop encoding time : 0.000
% 1.42/0.71 % Success case prop solver time : 0.000
% 1.42/0.71 % Current number of processed clauses : 360
% 1.42/0.71 % Positive orientable unit clauses : 130
% 1.42/0.71 % Positive unorientable unit clauses: 0
% 1.42/0.71 % Negative unit clauses : 3
% 1.42/0.71 % Non-unit-clauses : 227
% 1.42/0.71 % Current number of unprocessed clauses: 15186
% 1.42/0.71 % ...number of literals in the above : 23888
% 1.42/0.71 % Current number of archived formulas : 0
% 1.42/0.71 % Current number of archived clauses : 64
% 1.42/0.71 % Clause-clause subsumption calls (NU) : 26249
% 1.42/0.71 % Rec. Clause-clause subsumption calls : 26031
% 1.42/0.71 % Non-unit clause-clause subsumptions : 1714
% 1.42/0.71 % Unit Clause-clause subsumption calls : 2073
% 1.42/0.71 % Rewrite failures with RHS unbound : 0
% 1.42/0.71 % BW rewrite match attempts : 12536
% 1.42/0.71 % BW rewrite match successes : 31
% 1.42/0.71 % Condensation attempts : 0
% 1.42/0.71 % Condensation successes : 0
% 1.42/0.71 % Termbank termtop insertions : 320337
% 1.42/0.71 % Search garbage collected termcells : 8
% 1.42/0.71
% 1.42/0.71 % -------------------------------------------------
% 1.42/0.71 % User time : 0.175 s
% 1.42/0.71 % System time : 0.013 s
% 1.42/0.71 % Total time : 0.189 s
% 1.42/0.71 % Maximum resident set size: 3636 pages
% 1.42/0.71
% 1.42/0.71 % -------------------------------------------------
% 1.42/0.71 % User time : 1.193 s
% 1.42/0.71 % System time : 0.102 s
% 1.42/0.71 % Total time : 1.295 s
% 1.42/0.71 % Maximum resident set size: 4608 pages
% 1.42/0.71 % E exiting
%------------------------------------------------------------------------------