%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL072-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 : n012.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:41 PM UTC 2026
% Result : Unsatisfiable 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of clauses : 30 ( 17 unt; 0 nHn; 11 RR)
% Number of literals : 48 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 76 ( 16 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(cn_60,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_60) ).
cnf(cn_19,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_19) ).
cnf(cn_37,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_37) ).
cnf(prove_cn_3,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_3) ).
cnf(c_0_5,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_6,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(implies(X1,X2))
| is_a_theorem(X2) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,implies(not(X2),X3)),implies(X1,implies(implies(X4,X3),implies(implies(X2,X4),X3))))),
cn_60 ).
cnf(c_0_8,plain,
( ~ is_a_theorem(implies(X1,implies(not(X4),X3)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),implies(implies(X4,X2),X3)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
cn_19 ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(implies(X4,implies(not(X3),X2)))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_11,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(not(X1),X3))),
cn_37 ).
cnf(c_0_12,plain,
( ~ is_a_theorem(implies(implies(X3,X1),X2))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(implies(implies(X3,X4),X2))
| is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),X2))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_15,plain,
is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),implies(implies(X3,X1),implies(X2,implies(X3,X4))))),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(implies(X2,implies(X3,implies(X1,X4))))
| is_a_theorem(implies(implies(X1,X2),implies(X3,implies(X1,X4)))) ),
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,implies(X1,implies(X2,X3))))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(implies(X2,implies(X2,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_20,plain,
( ~ is_a_theorem(implies(implies(X1,X3),X2))
| is_a_theorem(implies(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_19]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(not(implies(X1,X2)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_25,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
inference(fof_simplification,[status(thm)],[prove_cn_3]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(implies(X2,not(X1)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
~ is_a_theorem(implies(a,implies(not(a),b))),
c_0_25 ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,implies(not(X1),X2))),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL072-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.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 00:03:07 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 Running first-order theorem proving
% 0.11/0.39 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.11/0.42 % Version: 3.5.1
% 0.11/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 % Starting sh5l with 300s (1) cores
% 0.11/0.42 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1189884 completed with status 0
% 0.11/0.42 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.11/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.11/0.42 % Starting H----_011_C07_F1_PI_SE_SP_S0V with 136s (1) cores
% 0.11/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.11/0.42 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 1189891 completed with status 0
% 0.11/0.42 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 0.11/0.42 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.42 % No SInE strategy applied
% 0.11/0.42 % Search class: FHUNS-FFSF21-MFFFFFNN
% 0.11/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.11/0.42 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.11/0.42 % Preprocessing time : 0.001 s
% 0.11/0.42
% 0.11/0.42 % Proof found!
% 0.11/0.42 % SZS status Unsatisfiable
% 0.11/0.42 % SZS output start CNFRefutation
% See solution above
% 0.11/0.42 % Parsed axioms : 5
% 0.11/0.42 % Removed by relevancy pruning/SinE : 0
% 0.11/0.42 % Initial clauses : 5
% 0.11/0.42 % Removed in clause preprocessing : 0
% 0.11/0.42 % Initial clauses in saturation : 5
% 0.11/0.42 % Processed clauses : 135
% 0.11/0.42 % ...of these trivial : 4
% 0.11/0.42 % ...subsumed : 59
% 0.11/0.42 % ...remaining for further processing : 72
% 0.11/0.42 % Other redundant clauses eliminated : 0
% 0.11/0.42 % Clauses deleted for lack of memory : 0
% 0.11/0.42 % Backward-subsumed : 3
% 0.11/0.42 % Backward-rewritten : 3
% 0.11/0.42 % Generated clauses : 436
% 0.11/0.42 % ...of the previous two non-redundant : 397
% 0.11/0.42 % ...aggressively subsumed : 0
% 0.11/0.42 % Contextual simplify-reflections : 0
% 0.11/0.42 % Paramodulations : 436
% 0.11/0.42 % Factorizations : 0
% 0.11/0.42 % NegExts : 0
% 0.11/0.42 % Equation resolutions : 0
% 0.11/0.42 % Disequality decompositions : 0
% 0.11/0.42 % Total rewrite steps : 32
% 0.11/0.42 % ...of those cached : 11
% 0.11/0.42 % Propositional unsat checks : 0
% 0.11/0.42 % Propositional check models : 0
% 0.11/0.42 % Propositional check unsatisfiable : 0
% 0.11/0.42 % Propositional clauses : 0
% 0.11/0.42 % Propositional clauses after purity: 0
% 0.11/0.42 % Propositional unsat core size : 0
% 0.11/0.42 % Propositional preprocessing time : 0.000
% 0.11/0.42 % Propositional encoding time : 0.000
% 0.11/0.42 % Propositional solver time : 0.000
% 0.11/0.42 % Success case prop preproc time : 0.000
% 0.11/0.42 % Success case prop encoding time : 0.000
% 0.11/0.42 % Success case prop solver time : 0.000
% 0.11/0.42 % Current number of processed clauses : 66
% 0.11/0.42 % Positive orientable unit clauses : 25
% 0.11/0.42 % Positive unorientable unit clauses: 0
% 0.11/0.42 % Negative unit clauses : 3
% 0.11/0.42 % Non-unit-clauses : 38
% 0.11/0.42 % Current number of unprocessed clauses: 227
% 0.11/0.42 % ...number of literals in the above : 432
% 0.11/0.42 % Current number of archived formulas : 0
% 0.11/0.42 % Current number of archived clauses : 6
% 0.11/0.42 % Clause-clause subsumption calls (NU) : 747
% 0.11/0.42 % Rec. Clause-clause subsumption calls : 747
% 0.11/0.42 % Non-unit clause-clause subsumptions : 60
% 0.11/0.42 % Unit Clause-clause subsumption calls : 86
% 0.11/0.42 % Rewrite failures with RHS unbound : 0
% 0.11/0.42 % BW rewrite match attempts : 332
% 0.11/0.42 % BW rewrite match successes : 4
% 0.11/0.42 % Condensation attempts : 0
% 0.11/0.42 % Condensation successes : 0
% 0.11/0.42 % Termbank termtop insertions : 6710
% 0.11/0.42 % Search garbage collected termcells : 8
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.011 s
% 0.11/0.42 % System time : 0.002 s
% 0.11/0.42 % Total time : 0.013 s
% 0.11/0.42 % Maximum resident set size: 3636 pages
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.051 s
% 0.11/0.42 % System time : 0.014 s
% 0.11/0.42 % Total time : 0.065 s
% 0.11/0.42 % Maximum resident set size: 4608 pages
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------