%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL029-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 : n007.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:18:17 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.63s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 13 RR)
% Number of literals : 50 ( 0 equ; 22 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 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 : 61 ( 21 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(c0_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_1) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_2) ).
cnf(c0_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_3) ).
cnf(c0_4,axiom,
is_a_theorem(implies(falsehood,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c0_4) ).
cnf(prove_c0_5,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_c0_5) ).
cnf(c_0_6,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_7,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_6 ).
cnf(c_0_8,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
c0_1 ).
cnf(c_0_9,plain,
( ~ is_a_theorem(implies(X3,X1))
| is_a_theorem(implies(implies(X1,X2),implies(X3,X2))) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(implies(X1,X3))
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
c0_2 ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
c0_3 ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(X1,X3))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,axiom,
is_a_theorem(implies(falsehood,X1)),
c0_4 ).
cnf(c_0_15,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X3,X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X1,falsehood))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X1,implies(X1,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_9]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(implies(implies(X2,X3),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_20,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),falsehood),X2)),
inference(spm,[status(thm)],[c_0_17,c_0_12]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(implies(X1,X2),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(falsehood,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(falsehood,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X1,implies(implies(falsehood,X3),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
inference(fof_simplification,[status(thm)],[prove_c0_5]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(X1,implies(implies(X2,X3),X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_27,plain,
is_a_theorem(implies(implies(X1,falsehood),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_24,c_0_8]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(implies(implies(a,falsehood),falsehood),a)),
c_0_25 ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(implies(X1,X2),falsehood),X1)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL029-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45 % Computer : n007.cluster.edu
% 0.20/0.45 % Model : x86_64 x86_64
% 0.20/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45 % Memory : 8046.5625MB
% 0.20/0.45 % OS : Linux 6.8.0-71-generic
% 0.20/0.45 % CPULimit : 300
% 0.20/0.45 % WCLimit : 300
% 0.20/0.45 % DateTime : Sun Sep 20 23:58:50 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.53 Running first-order theorem proving
% 0.26/0.53 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.49/0.63 % Version: 3.5.1
% 0.49/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.63 % Starting sh5l with 300s (1) cores
% 0.49/0.63 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3917497 completed with status 0
% 0.49/0.63 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.49/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.63 % No SInE strategy applied
% 0.49/0.63 % Search class: FHUNM-FFSF22-MFFFFFNN
% 0.49/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.49/0.63 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.63 % Starting G-E--_300_C01_S00 with 136s (1) cores
% 0.49/0.63 % Starting new_bool_3 with 136s (1) cores
% 0.49/0.63 % SubtermCWHack with pid 3917498 completed with status 0
% 0.49/0.63 % Result found by SubtermCWHack
% 0.49/0.63 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.63 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.63 % No SInE strategy applied
% 0.49/0.63 % Search class: FHUNM-FFSF22-MFFFFFNN
% 0.49/0.63 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.63 % Preprocessing time : 0.002 s
% 0.49/0.63
% 0.49/0.63 % Proof found!
% 0.49/0.63 % SZS status Unsatisfiable
% 0.49/0.63 % SZS output start CNFRefutation
% See solution above
% 0.49/0.63 % Parsed axioms : 6
% 0.49/0.63 % Removed by relevancy pruning/SinE : 0
% 0.49/0.63 % Initial clauses : 6
% 0.49/0.63 % Removed in clause preprocessing : 0
% 0.49/0.63 % Initial clauses in saturation : 6
% 0.49/0.63 % Processed clauses : 428
% 0.49/0.63 % ...of these trivial : 6
% 0.49/0.63 % ...subsumed : 323
% 0.49/0.63 % ...remaining for further processing : 99
% 0.49/0.63 % Other redundant clauses eliminated : 0
% 0.49/0.63 % Clauses deleted for lack of memory : 0
% 0.49/0.63 % Backward-subsumed : 1
% 0.49/0.63 % Backward-rewritten : 1
% 0.49/0.63 % Generated clauses : 1696
% 0.49/0.63 % ...of the previous two non-redundant : 1233
% 0.49/0.63 % ...aggressively subsumed : 0
% 0.49/0.63 % Contextual simplify-reflections : 0
% 0.49/0.63 % Paramodulations : 1696
% 0.49/0.63 % Factorizations : 0
% 0.49/0.63 % NegExts : 0
% 0.49/0.63 % Equation resolutions : 0
% 0.49/0.63 % Disequality decompositions : 0
% 0.49/0.63 % Total rewrite steps : 395
% 0.49/0.63 % ...of those cached : 309
% 0.49/0.63 % Propositional unsat checks : 0
% 0.49/0.63 % Propositional check models : 0
% 0.49/0.63 % Propositional check unsatisfiable : 0
% 0.49/0.63 % Propositional clauses : 0
% 0.49/0.63 % Propositional clauses after purity: 0
% 0.49/0.63 % Propositional unsat core size : 0
% 0.49/0.63 % Propositional preprocessing time : 0.000
% 0.49/0.63 % Propositional encoding time : 0.000
% 0.49/0.63 % Propositional solver time : 0.000
% 0.49/0.63 % Success case prop preproc time : 0.000
% 0.49/0.63 % Success case prop encoding time : 0.000
% 0.49/0.63 % Success case prop solver time : 0.000
% 0.49/0.63 % Current number of processed clauses : 97
% 0.49/0.63 % Positive orientable unit clauses : 25
% 0.49/0.63 % Positive unorientable unit clauses: 0
% 0.49/0.63 % Negative unit clauses : 3
% 0.49/0.63 % Non-unit-clauses : 69
% 0.49/0.63 % Current number of unprocessed clauses: 811
% 0.49/0.63 % ...number of literals in the above : 1845
% 0.49/0.63 % Current number of archived formulas : 0
% 0.49/0.63 % Current number of archived clauses : 2
% 0.49/0.63 % Clause-clause subsumption calls (NU) : 1894
% 0.49/0.63 % Rec. Clause-clause subsumption calls : 1894
% 0.49/0.63 % Non-unit clause-clause subsumptions : 253
% 0.49/0.63 % Unit Clause-clause subsumption calls : 109
% 0.49/0.63 % Rewrite failures with RHS unbound : 0
% 0.49/0.63 % BW rewrite match attempts : 520
% 0.49/0.63 % BW rewrite match successes : 1
% 0.49/0.63 % Condensation attempts : 0
% 0.49/0.63 % Condensation successes : 0
% 0.49/0.63 % Termbank termtop insertions : 18716
% 0.49/0.63 % Search garbage collected termcells : 8
% 0.49/0.63
% 0.49/0.63 % -------------------------------------------------
% 0.49/0.63 % User time : 0.037 s
% 0.49/0.63 % System time : 0.008 s
% 0.49/0.63 % Total time : 0.045 s
% 0.49/0.63 % Maximum resident set size: 3324 pages
% 0.49/0.63
% 0.49/0.63 % -------------------------------------------------
% 0.49/0.63 % User time : 0.111 s
% 0.49/0.63 % System time : 0.026 s
% 0.49/0.63 % Total time : 0.137 s
% 0.49/0.63 % Maximum resident set size: 4608 pages
% 0.49/0.63 % E exiting
%------------------------------------------------------------------------------