%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL320-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:25 PM UTC 2026
% Result : Unsatisfiable 0.25s 5.90s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of clauses : 53 ( 30 unt; 0 nHn; 23 RR)
% Number of literals : 83 ( 2 equ; 34 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 113 ( 20 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(implies(p,q),implies(not(p),q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_9 ).
cnf(c_0_11,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_12,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_13,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_12 ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_22,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_25,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_28,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_30,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_31,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_32,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_34,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_35,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_36,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_33]) ).
cnf(c_0_37,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_38,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_35]) ).
cnf(c_0_39,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_36]) ).
cnf(c_0_40,plain,
( ~ theorem(or(or(or(X1,or(or(X2,X3),X4)),X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_28,c_0_37]) ).
cnf(c_0_41,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_42,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_14]) ).
cnf(c_0_43,plain,
theorem(or(X1,or(or(X2,not(X3)),X3))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_27]) ).
cnf(c_0_45,plain,
theorem(or(or(X1,not(X2)),or(X3,X2))),
inference(spm,[status(thm)],[c_0_22,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(or(implies(p,q),implies(not(p),q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_47,plain,
theorem(or(or(X1,not(X2)),or(X2,X3))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ theorem(or(implies(p,q),implies(not(p),q))),
c_0_46 ).
cnf(c_0_49,plain,
theorem(or(or(X1,X2),or(X3,not(X1)))),
inference(spm,[status(thm)],[c_0_31,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
~ theorem(or(or(not(p),q),or(not(not(p)),q))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_11]),c_0_11]) ).
cnf(c_0_51,plain,
theorem(or(or(X1,X2),or(not(X1),X3))),
inference(spm,[status(thm)],[c_0_44,c_0_49]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL320-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/5.48 % Computer : n019.cluster.edu
% 0.21/5.48 % Model : x86_64 x86_64
% 0.21/5.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/5.48 % Memory : 8046.5625MB
% 0.21/5.48 % OS : Linux 6.8.0-71-generic
% 0.21/5.48 % CPULimit : 300
% 0.21/5.48 % WCLimit : 300
% 0.21/5.48 % DateTime : Mon Sep 21 00:21:27 UTC 2026
% 0.21/5.49 % CPUTime :
% 0.21/5.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/5.55 Running first-order theorem proving
% 0.25/5.55 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.25/5.90 % Version: 3.5.1
% 0.25/5.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.90 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.90 % Starting new_bool_1 with 300s (1) cores
% 0.25/5.90 % Starting sh5l with 300s (1) cores
% 0.25/5.90 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1297400 completed with status 0
% 0.25/5.90 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.25/5.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.90 % No SInE strategy applied
% 0.25/5.90 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.25/5.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.90 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.25/5.90 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.25/5.90 % Starting new_bool_3 with 136s (1) cores
% 0.25/5.90 % Starting new_bool_1 with 136s (1) cores
% 0.25/5.90 % SubtermCWHack with pid 1297404 completed with status 0
% 0.25/5.90 % Result found by SubtermCWHack
% 0.25/5.90 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.25/5.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.90 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.25/5.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/5.90 % No SInE strategy applied
% 0.25/5.90 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.25/5.90 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/5.90 % Starting SubtermCWHack with 136s (1) cores
% 0.25/5.90 % Preprocessing time : 0.002 s
% 0.25/5.90
% 0.25/5.90 % Proof found!
% 0.25/5.90 % SZS status Unsatisfiable
% 0.25/5.90 % SZS output start CNFRefutation
% See solution above
% 0.25/5.90 % Parsed axioms : 9
% 0.25/5.90 % Removed by relevancy pruning/SinE : 0
% 0.25/5.90 % Initial clauses : 9
% 0.25/5.90 % Removed in clause preprocessing : 1
% 0.25/5.90 % Initial clauses in saturation : 8
% 0.25/5.90 % Processed clauses : 3186
% 0.25/5.90 % ...of these trivial : 86
% 0.25/5.90 % ...subsumed : 2417
% 0.25/5.90 % ...remaining for further processing : 683
% 0.25/5.90 % Other redundant clauses eliminated : 0
% 0.25/5.90 % Clauses deleted for lack of memory : 0
% 0.25/5.90 % Backward-subsumed : 0
% 0.25/5.90 % Backward-rewritten : 4
% 0.25/5.90 % Generated clauses : 15076
% 0.25/5.90 % ...of the previous two non-redundant : 12843
% 0.25/5.90 % ...aggressively subsumed : 0
% 0.25/5.90 % Contextual simplify-reflections : 0
% 0.25/5.90 % Paramodulations : 15076
% 0.25/5.90 % Factorizations : 0
% 0.25/5.90 % NegExts : 0
% 0.25/5.90 % Equation resolutions : 0
% 0.25/5.90 % Disequality decompositions : 0
% 0.25/5.90 % Total rewrite steps : 2193
% 0.25/5.90 % ...of those cached : 1929
% 0.25/5.90 % Propositional unsat checks : 0
% 0.25/5.90 % Propositional check models : 0
% 0.25/5.90 % Propositional check unsatisfiable : 0
% 0.25/5.90 % Propositional clauses : 0
% 0.25/5.90 % Propositional clauses after purity: 0
% 0.25/5.90 % Propositional unsat core size : 0
% 0.25/5.90 % Propositional preprocessing time : 0.000
% 0.25/5.90 % Propositional encoding time : 0.000
% 0.25/5.90 % Propositional solver time : 0.000
% 0.25/5.90 % Success case prop preproc time : 0.000
% 0.25/5.90 % Success case prop encoding time : 0.000
% 0.25/5.90 % Success case prop solver time : 0.000
% 0.25/5.90 % Current number of processed clauses : 679
% 0.25/5.90 % Positive orientable unit clauses : 147
% 0.25/5.90 % Positive unorientable unit clauses: 0
% 0.25/5.90 % Negative unit clauses : 52
% 0.25/5.90 % Non-unit-clauses : 480
% 0.25/5.90 % Current number of unprocessed clauses: 9580
% 0.25/5.90 % ...number of literals in the above : 22395
% 0.25/5.90 % Current number of archived formulas : 0
% 0.25/5.90 % Current number of archived clauses : 5
% 0.25/5.90 % Clause-clause subsumption calls (NU) : 37235
% 0.25/5.90 % Rec. Clause-clause subsumption calls : 36730
% 0.25/5.90 % Non-unit clause-clause subsumptions : 2318
% 0.25/5.90 % Unit Clause-clause subsumption calls : 2325
% 0.25/5.90 % Rewrite failures with RHS unbound : 0
% 0.25/5.90 % BW rewrite match attempts : 4740
% 0.25/5.90 % BW rewrite match successes : 3
% 0.25/5.90 % Condensation attempts : 0
% 0.25/5.90 % Condensation successes : 0
% 0.25/5.90 % Termbank termtop insertions : 180684
% 0.25/5.90 % Search garbage collected termcells : 11
% 0.25/5.90
% 0.25/5.90 % -------------------------------------------------
% 0.25/5.90 % User time : 0.294 s
% 0.25/5.90 % System time : 0.018 s
% 0.25/5.90 % Total time : 0.312 s
% 0.25/5.90 % Maximum resident set size: 3384 pages
% 0.25/5.90
% 0.25/5.90 % -------------------------------------------------
% 0.25/5.90 % User time : 1.222 s
% 0.25/5.90 % System time : 0.085 s
% 0.25/5.90 % Total time : 1.307 s
% 0.25/5.90 % Maximum resident set size: 4864 pages
% 0.25/5.90 % E exiting
%------------------------------------------------------------------------------