%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:12:43 PM UTC 2026
% Result : Unsatisfiable 0.74s 0.53s
% Output : CNFRefutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 17 unt; 0 nHn; 16 RR)
% Number of literals : 54 ( 0 equ; 29 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 18 ( 18 usr; 17 con; 0-2 aty)
% Number of variables : 61 ( 3 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(mv2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv2) ).
cnf(mv3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv3) ).
cnf(mv1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv1) ).
cnf(prove_hr,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_hr) ).
cnf(mv5,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mv5) ).
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)))),
mv2 ).
cnf(c_0_9,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv3 ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv1 ).
cnf(c_0_11,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_12,plain,
( ~ is_a_theorem(implies(implies(X2,X1),X1))
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(X2)
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_14,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_11]) ).
cnf(c_0_15,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(implies(implies(X1,X2),X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
inference(fof_simplification,[status(thm)],[prove_hr]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| is_a_theorem(implies(implies(X1,implies(X2,X3)),X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
~ is_a_theorem(implies(implies(implies(x,implies(y,x)),implies(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13),implies(implies(v14,implies(v15,v14)),v16))),v16)),
c_0_17 ).
cnf(c_0_20,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X3)
| is_a_theorem(implies(implies(X1,implies(X2,implies(X3,X4))),X4)) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(implies(X1,implies(implies(X3,X2),X2)))
| is_a_theorem(implies(X1,implies(implies(X2,X3),X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_9]) ).
cnf(c_0_22,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10),implies(implies(implies(implies(v11,v12),implies(v12,v11)),implies(v12,v11)),v13)),v13)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_10])]) ).
cnf(c_0_23,axiom,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X1)),implies(X2,X1))),
mv5 ).
cnf(c_0_24,plain,
( ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_11]) ).
cnf(c_0_25,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_21,c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7),implies(implies(implies(implies(v8,v9),v9),implies(implies(v9,v8),v8)),v10)),v10)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_23])]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(implies(X2,implies(X1,X3)))
| is_a_theorem(implies(X1,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
~ is_a_theorem(implies(implies(implies(implies(z,u),implies(implies(v,z),implies(v,u))),implies(implies(w,implies(v6,w)),v7)),v7)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_18]),c_0_9])]) ).
cnf(c_0_29,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_10]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL428-1 : TPTP v9.3.1. Bugfixed v5.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n005.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:31:33 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/0.41 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.74/0.53 % Version: 3.5.1
% 0.74/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.74/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.74/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.74/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.74/0.53 % Starting sh5l with 300s (1) cores
% 0.74/0.53 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 2157086 completed with status 0
% 0.74/0.53 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.74/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.74/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.74/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.74/0.53 % No SInE strategy applied
% 0.74/0.53 % Search class: FHUNM-FFSF22-DFFFFFNN
% 0.74/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.74/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.74/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.74/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.74/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.74/0.53 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 2157092 completed with status 0
% 0.74/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.74/0.53 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.74/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.74/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.74/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.74/0.53 % No SInE strategy applied
% 0.74/0.53 % Search class: FHUNM-FFSF22-DFFFFFNN
% 0.74/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.74/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.74/0.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.74/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.74/0.53 % Preprocessing time : 0.001 s
% 0.74/0.53 % Presaturation interreduction done
% 0.74/0.53
% 0.74/0.53 % Proof found!
% 0.74/0.53 % SZS status Unsatisfiable
% 0.74/0.53 % SZS output start CNFRefutation
% See solution above
% 0.74/0.53 % Parsed axioms : 6
% 0.74/0.53 % Removed by relevancy pruning/SinE : 0
% 0.74/0.53 % Initial clauses : 6
% 0.74/0.53 % Removed in clause preprocessing : 0
% 0.74/0.53 % Initial clauses in saturation : 6
% 0.74/0.53 % Processed clauses : 1134
% 0.74/0.53 % ...of these trivial : 5
% 0.74/0.53 % ...subsumed : 935
% 0.74/0.53 % ...remaining for further processing : 194
% 0.74/0.53 % Other redundant clauses eliminated : 0
% 0.74/0.53 % Clauses deleted for lack of memory : 0
% 0.74/0.53 % Backward-subsumed : 5
% 0.74/0.53 % Backward-rewritten : 4
% 0.74/0.53 % Generated clauses : 6490
% 0.74/0.53 % ...of the previous two non-redundant : 5855
% 0.74/0.53 % ...aggressively subsumed : 0
% 0.74/0.53 % Contextual simplify-reflections : 0
% 0.74/0.53 % Paramodulations : 6490
% 0.74/0.53 % Factorizations : 0
% 0.74/0.53 % NegExts : 0
% 0.74/0.53 % Equation resolutions : 0
% 0.74/0.53 % Disequality decompositions : 0
% 0.74/0.53 % Total rewrite steps : 583
% 0.74/0.53 % ...of those cached : 468
% 0.74/0.53 % Propositional unsat checks : 0
% 0.74/0.53 % Propositional check models : 0
% 0.74/0.53 % Propositional check unsatisfiable : 0
% 0.74/0.53 % Propositional clauses : 0
% 0.74/0.53 % Propositional clauses after purity: 0
% 0.74/0.53 % Propositional unsat core size : 0
% 0.74/0.53 % Propositional preprocessing time : 0.000
% 0.74/0.53 % Propositional encoding time : 0.000
% 0.74/0.53 % Propositional solver time : 0.000
% 0.74/0.53 % Success case prop preproc time : 0.000
% 0.74/0.53 % Success case prop encoding time : 0.000
% 0.74/0.53 % Success case prop solver time : 0.000
% 0.74/0.53 % Current number of processed clauses : 179
% 0.74/0.53 % Positive orientable unit clauses : 22
% 0.74/0.53 % Positive unorientable unit clauses: 0
% 0.74/0.53 % Negative unit clauses : 7
% 0.74/0.53 % Non-unit-clauses : 150
% 0.74/0.53 % Current number of unprocessed clauses: 4651
% 0.74/0.53 % ...number of literals in the above : 11814
% 0.74/0.53 % Current number of archived formulas : 0
% 0.74/0.53 % Current number of archived clauses : 15
% 0.74/0.53 % Clause-clause subsumption calls (NU) : 13076
% 0.74/0.53 % Rec. Clause-clause subsumption calls : 10193
% 0.74/0.53 % Non-unit clause-clause subsumptions : 940
% 0.74/0.53 % Unit Clause-clause subsumption calls : 320
% 0.74/0.53 % Rewrite failures with RHS unbound : 0
% 0.74/0.53 % BW rewrite match attempts : 742
% 0.74/0.53 % BW rewrite match successes : 4
% 0.74/0.53 % Condensation attempts : 0
% 0.74/0.53 % Condensation successes : 0
% 0.74/0.53 % Termbank termtop insertions : 77012
% 0.74/0.53 % Search garbage collected termcells : 8
% 0.74/0.53
% 0.74/0.53 % -------------------------------------------------
% 0.74/0.53 % User time : 0.087 s
% 0.74/0.53 % System time : 0.013 s
% 0.74/0.53 % Total time : 0.100 s
% 0.74/0.53 % Maximum resident set size: 3652 pages
% 0.74/0.53
% 0.74/0.53 % -------------------------------------------------
% 0.74/0.53 % User time : 0.433 s
% 0.74/0.53 % System time : 0.049 s
% 0.74/0.53 % Total time : 0.481 s
% 0.74/0.53 % Maximum resident set size: 4608 pages
% 0.74/0.53 % E exiting
%------------------------------------------------------------------------------