%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL285-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:21 PM UTC 2026
% Result : Unsatisfiable 2.15s 0.79s
% Output : CNFRefutation 2.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of clauses : 68 ( 35 unt; 0 nHn; 33 RR)
% Number of literals : 112 ( 7 equ; 52 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 128 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(p,or(p,and(p,q)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
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,
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_20,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_25,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_26,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_27,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_28,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_23]) ).
cnf(c_0_29,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_30,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_31,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_32,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_27,c_0_13]) ).
cnf(c_0_33,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_34,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
~ theorem(equivalent(p,or(p,and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_37,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_38,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_40,plain,
( ~ axiom(or(X2,or(not(X4),X3)))
| ~ theorem(or(X1,X4))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_41,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_31]) ).
cnf(c_0_42,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_34,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
~ theorem(equivalent(p,or(p,and(p,q)))),
c_0_35 ).
cnf(c_0_44,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_13]),c_0_13]),c_0_37]) ).
cnf(c_0_45,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_38]) ).
cnf(c_0_46,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_39]) ).
cnf(c_0_47,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_22,c_0_28]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_40,c_0_32]) ).
cnf(c_0_49,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_50,negated_conjecture,
~ theorem(not(or(not(or(not(p),or(p,not(or(not(p),not(q)))))),not(or(not(or(p,not(or(not(p),not(q))))),p))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_37]),c_0_44]) ).
cnf(c_0_51,plain,
( ~ theorem(X2)
| ~ theorem(X1)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_52,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_46]) ).
cnf(c_0_53,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(or(not(or(X1,X2)),X3),X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_47]) ).
cnf(c_0_54,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_33,c_0_16]) ).
cnf(c_0_55,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( ~ theorem(or(not(or(p,not(or(not(p),not(q))))),p))
| ~ theorem(or(not(p),or(p,not(or(not(p),not(q)))))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_57,plain,
( ~ theorem(or(not(X2),X1))
| theorem(or(not(or(X1,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_54,c_0_31]) ).
cnf(c_0_59,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_22,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
( ~ theorem(or(not(not(or(not(p),not(q)))),p))
| ~ theorem(or(not(p),or(p,not(or(not(p),not(q)))))) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_61,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_62,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_33,c_0_49]) ).
cnf(c_0_63,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(q)))),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_64,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(not(X1)),X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_62]) ).
cnf(c_0_65,negated_conjecture,
~ theorem(or(p,or(not(p),not(q)))),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_66,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_22,c_0_61]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL285-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n026.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:21:06 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 2.15/0.79 % Version: 3.5.1
% 2.15/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.15/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.15/0.79 % Starting new_bool_3 with 300s (1) cores
% 2.15/0.79 % Starting new_bool_1 with 300s (1) cores
% 2.15/0.79 % Starting sh5l with 300s (1) cores
% 2.15/0.79 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 961286 completed with status 0
% 2.15/0.79 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.15/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.15/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.15/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.15/0.79 % No SInE strategy applied
% 2.15/0.79 % Search class: FHUNM-FFSF21-DFFFFFNN
% 2.15/0.79 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.15/0.79 % Starting SubtermCWHack with 151s (1) cores
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 2.15/0.79 % Starting new_bool_3 with 329s (1) cores
% 2.15/0.79 % Starting new_bool_1 with 291s (1) cores
% 2.15/0.79 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 961292 completed with status 0
% 2.15/0.79 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.15/0.79 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.15/0.79 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.15/0.79 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.15/0.79 % No SInE strategy applied
% 2.15/0.79 % Search class: FHUNM-FFSF21-DFFFFFNN
% 2.15/0.79 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 2.15/0.79 % Starting SubtermCWHack with 151s (1) cores
% 2.15/0.79 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 2.15/0.79 % Preprocessing time : 0.035 s
% 2.15/0.79
% 2.15/0.79 % Proof found!
% 2.15/0.79 % SZS status Unsatisfiable
% 2.15/0.79 % SZS output start CNFRefutation
% See solution above
% 2.15/0.80 % Parsed axioms : 11
% 2.15/0.80 % Removed by relevancy pruning/SinE : 0
% 2.15/0.80 % Initial clauses : 11
% 2.15/0.80 % Removed in clause preprocessing : 3
% 2.15/0.80 % Initial clauses in saturation : 8
% 2.15/0.80 % Processed clauses : 1390
% 2.15/0.80 % ...of these trivial : 4
% 2.15/0.80 % ...subsumed : 789
% 2.15/0.80 % ...remaining for further processing : 597
% 2.15/0.80 % Other redundant clauses eliminated : 0
% 2.15/0.80 % Clauses deleted for lack of memory : 0
% 2.15/0.80 % Backward-subsumed : 107
% 2.15/0.80 % Backward-rewritten : 7
% 2.15/0.80 % Generated clauses : 8800
% 2.15/0.80 % ...of the previous two non-redundant : 8484
% 2.15/0.80 % ...aggressively subsumed : 0
% 2.15/0.80 % Contextual simplify-reflections : 3
% 2.15/0.80 % Paramodulations : 8800
% 2.15/0.80 % Factorizations : 0
% 2.15/0.80 % NegExts : 0
% 2.15/0.80 % Equation resolutions : 0
% 2.15/0.80 % Disequality decompositions : 0
% 2.15/0.80 % Total rewrite steps : 196
% 2.15/0.80 % ...of those cached : 142
% 2.15/0.80 % Propositional unsat checks : 0
% 2.15/0.80 % Propositional check models : 0
% 2.15/0.80 % Propositional check unsatisfiable : 0
% 2.15/0.80 % Propositional clauses : 0
% 2.15/0.80 % Propositional clauses after purity: 0
% 2.15/0.80 % Propositional unsat core size : 0
% 2.15/0.80 % Propositional preprocessing time : 0.000
% 2.15/0.80 % Propositional encoding time : 0.000
% 2.15/0.80 % Propositional solver time : 0.000
% 2.15/0.80 % Success case prop preproc time : 0.000
% 2.15/0.80 % Success case prop encoding time : 0.000
% 2.15/0.80 % Success case prop solver time : 0.000
% 2.15/0.80 % Current number of processed clauses : 483
% 2.15/0.80 % Positive orientable unit clauses : 43
% 2.15/0.80 % Positive unorientable unit clauses: 0
% 2.15/0.80 % Negative unit clauses : 31
% 2.15/0.80 % Non-unit-clauses : 409
% 2.15/0.80 % Current number of unprocessed clauses: 7088
% 2.15/0.80 % ...number of literals in the above : 22467
% 2.15/0.80 % Current number of archived formulas : 0
% 2.15/0.80 % Current number of archived clauses : 117
% 2.15/0.80 % Clause-clause subsumption calls (NU) : 29819
% 2.15/0.80 % Rec. Clause-clause subsumption calls : 28124
% 2.15/0.80 % Non-unit clause-clause subsumptions : 715
% 2.15/0.80 % Unit Clause-clause subsumption calls : 1881
% 2.15/0.80 % Rewrite failures with RHS unbound : 0
% 2.15/0.80 % BW rewrite match attempts : 1453
% 2.15/0.80 % BW rewrite match successes : 4
% 2.15/0.80 % Condensation attempts : 0
% 2.15/0.80 % Condensation successes : 0
% 2.15/0.80 % Termbank termtop insertions : 161397
% 2.15/0.80 % Search garbage collected termcells : 11
% 2.15/0.80
% 2.15/0.80 % -------------------------------------------------
% 2.15/0.80 % User time : 0.337 s
% 2.15/0.80 % System time : 0.018 s
% 2.15/0.80 % Total time : 0.356 s
% 2.15/0.80 % Maximum resident set size: 3388 pages
% 2.15/0.80
% 2.15/0.80 % -------------------------------------------------
% 2.15/0.80 % User time : 1.535 s
% 2.15/0.80 % System time : 0.105 s
% 2.15/0.80 % Total time : 1.640 s
% 2.15/0.80 % Maximum resident set size: 4608 pages
% 2.15/0.80 % E exiting
%------------------------------------------------------------------------------