%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL196-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 : n006.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:03 PM UTC 2026
% Result : Unsatisfiable 49.91s 7.92s
% Output : CNFRefutation 49.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 9
% Syntax : Number of clauses : 69 ( 36 unt; 0 nHn; 31 RR)
% Number of literals : 113 ( 2 equ; 48 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 139 ( 17 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_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(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(prove_this,negated_conjecture,
~ theorem(implies(or(p,or(p,q)),or(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,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,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_18,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_19,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_21,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_22,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_23,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_25,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_26,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_27,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_23,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_28,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_29,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_30,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_31,plain,
( ~ theorem(X2)
| theorem(or(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_21]) ).
cnf(c_0_32,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_33,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_30,c_0_11]) ).
cnf(c_0_35,plain,
( ~ axiom(X2)
| theorem(or(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_14]) ).
cnf(c_0_36,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
cnf(c_0_37,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_33,c_0_22]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_34]) ).
cnf(c_0_39,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_35,c_0_21]) ).
cnf(c_0_40,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_14]) ).
cnf(c_0_41,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_21]) ).
cnf(c_0_42,plain,
( ~ theorem(X2)
| theorem(or(not(or(X1,not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_34]) ).
cnf(c_0_43,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_40,c_0_34]) ).
cnf(c_0_45,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_41]) ).
cnf(c_0_46,plain,
( ~ theorem(X2)
| ~ theorem(or(X1,not(X2)))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_42]) ).
cnf(c_0_47,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_36,c_0_43]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X1,or(X3,or(X2,X4))))
| theorem(or(X1,or(X2,or(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_17]) ).
cnf(c_0_49,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
( ~ theorem(not(X2))
| ~ theorem(or(X1,X2))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_38,c_0_14]) ).
cnf(c_0_52,plain,
theorem(or(not(X1),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_19,c_0_39]) ).
cnf(c_0_54,plain,
( ~ axiom(or(X2,X1))
| ~ theorem(not(X2))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( ~ theorem(or(not(not(X1)),X1))
| theorem(not(not(X1))) ),
inference(spm,[status(thm)],[c_0_28,c_0_47]) ).
cnf(c_0_56,plain,
theorem(or(X1,or(not(X2),or(X2,X3)))),
inference(spm,[status(thm)],[c_0_19,c_0_52]) ).
cnf(c_0_57,plain,
theorem(or(or(not(or(X1,X2)),X2),X1)),
inference(spm,[status(thm)],[c_0_38,c_0_53]) ).
cnf(c_0_58,plain,
( ~ theorem(not(not(or(not(X2),X3))))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_54,c_0_27]) ).
cnf(c_0_59,plain,
theorem(not(not(or(not(X1),or(X1,X2))))),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
~ theorem(implies(or(p,or(p,q)),or(p,q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_61,plain,
theorem(or(not(or(X1,X1)),X1)),
inference(spm,[status(thm)],[c_0_33,c_0_57]) ).
cnf(c_0_62,plain,
theorem(or(not(or(X1,X2)),or(X1,or(X2,X3)))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
~ theorem(implies(or(p,or(p,q)),or(p,q))),
c_0_60 ).
cnf(c_0_64,plain,
( ~ theorem(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_36,c_0_61]) ).
cnf(c_0_65,plain,
theorem(or(not(or(X1,X2)),or(X2,or(X1,X3)))),
inference(spm,[status(thm)],[c_0_48,c_0_62]) ).
cnf(c_0_66,negated_conjecture,
~ theorem(or(not(or(p,or(p,q))),or(p,q))),
inference(rw,[status(thm)],[c_0_63,c_0_11]) ).
cnf(c_0_67,plain,
theorem(or(not(or(X1,or(X1,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL196-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.22/0.46 % Computer : n006.cluster.edu
% 0.22/0.46 % Model : x86_64 x86_64
% 0.22/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.46 % Memory : 8046.5625MB
% 0.22/0.46 % OS : Linux 6.8.0-71-generic
% 0.22/0.46 % CPULimit : 300
% 0.22/0.46 % WCLimit : 300
% 0.22/0.46 % DateTime : Mon Sep 21 00:10:27 UTC 2026
% 0.22/0.47 % CPUTime :
% 0.22/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.55 Running first-order theorem proving
% 0.25/0.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
% 49.91/7.92 % Version: 3.5.1
% 49.91/7.92 % Preprocessing class: FSSSSMSSSSSNFFN.
% 49.91/7.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.91/7.92 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 49.91/7.92 % Starting new_bool_3 with 300s (1) cores
% 49.91/7.92 % Starting new_bool_1 with 300s (1) cores
% 49.91/7.92 % Starting sh5l with 300s (1) cores
% 49.91/7.92 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1602725 completed with status 0
% 49.91/7.92 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 49.91/7.92 % Preprocessing class: FSSSSMSSSSSNFFN.
% 49.91/7.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.91/7.92 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 49.91/7.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 49.91/7.92 % No SInE strategy applied
% 49.91/7.92 % Search class: FHUNM-FFSF21-MFFFFFNN
% 49.91/7.92 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 49.91/7.92 % Starting SubtermCWHack with 136s (1) cores
% 49.91/7.92 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 49.91/7.92 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 49.91/7.92 % Starting new_bool_3 with 136s (1) cores
% 49.91/7.92 % Starting new_bool_1 with 136s (1) cores
% 49.91/7.92 % SubtermCWHack with pid 1602727 completed with status 0
% 49.91/7.92 % Result found by SubtermCWHack
% 49.91/7.92 % Preprocessing class: FSSSSMSSSSSNFFN.
% 49.91/7.92 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.91/7.92 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 49.91/7.92 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 49.91/7.92 % No SInE strategy applied
% 49.91/7.92 % Search class: FHUNM-FFSF21-MFFFFFNN
% 49.91/7.92 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 49.91/7.92 % Starting SubtermCWHack with 136s (1) cores
% 49.91/7.92 % Preprocessing time : 0.002 s
% 49.91/7.92
% 49.91/7.92 % Proof found!
% 49.91/7.92 % SZS status Unsatisfiable
% 49.91/7.92 % SZS output start CNFRefutation
% See solution above
% 49.91/7.92 % Parsed axioms : 9
% 49.91/7.92 % Removed by relevancy pruning/SinE : 0
% 49.91/7.92 % Initial clauses : 9
% 49.91/7.92 % Removed in clause preprocessing : 1
% 49.91/7.92 % Initial clauses in saturation : 8
% 49.91/7.92 % Processed clauses : 18993
% 49.91/7.92 % ...of these trivial : 2935
% 49.91/7.92 % ...subsumed : 13528
% 49.91/7.92 % ...remaining for further processing : 2530
% 49.91/7.92 % Other redundant clauses eliminated : 0
% 49.91/7.92 % Clauses deleted for lack of memory : 0
% 49.91/7.92 % Backward-subsumed : 54
% 49.91/7.92 % Backward-rewritten : 17
% 49.91/7.92 % Generated clauses : 357802
% 49.91/7.92 % ...of the previous two non-redundant : 314449
% 49.91/7.92 % ...aggressively subsumed : 0
% 49.91/7.92 % Contextual simplify-reflections : 0
% 49.91/7.92 % Paramodulations : 357802
% 49.91/7.92 % Factorizations : 0
% 49.91/7.92 % NegExts : 0
% 49.91/7.92 % Equation resolutions : 0
% 49.91/7.92 % Disequality decompositions : 0
% 49.91/7.92 % Total rewrite steps : 46567
% 49.91/7.92 % ...of those cached : 39298
% 49.91/7.92 % Propositional unsat checks : 0
% 49.91/7.92 % Propositional check models : 0
% 49.91/7.92 % Propositional check unsatisfiable : 0
% 49.91/7.92 % Propositional clauses : 0
% 49.91/7.92 % Propositional clauses after purity: 0
% 49.91/7.92 % Propositional unsat core size : 0
% 49.91/7.92 % Propositional preprocessing time : 0.000
% 49.91/7.92 % Propositional encoding time : 0.000
% 49.91/7.92 % Propositional solver time : 0.000
% 49.91/7.92 % Success case prop preproc time : 0.000
% 49.91/7.92 % Success case prop encoding time : 0.000
% 49.91/7.92 % Success case prop solver time : 0.000
% 49.91/7.92 % Current number of processed clauses : 2459
% 49.91/7.92 % Positive orientable unit clauses : 1007
% 49.91/7.92 % Positive unorientable unit clauses: 0
% 49.91/7.92 % Negative unit clauses : 41
% 49.91/7.92 % Non-unit-clauses : 1411
% 49.91/7.92 % Current number of unprocessed clauses: 295352
% 49.91/7.92 % ...number of literals in the above : 665512
% 49.91/7.92 % Current number of archived formulas : 0
% 49.91/7.92 % Current number of archived clauses : 72
% 49.91/7.92 % Clause-clause subsumption calls (NU) : 414856
% 49.91/7.92 % Rec. Clause-clause subsumption calls : 402063
% 49.91/7.92 % Non-unit clause-clause subsumptions : 13543
% 49.91/7.92 % Unit Clause-clause subsumption calls : 58855
% 49.91/7.92 % Rewrite failures with RHS unbound : 0
% 49.91/7.92 % BW rewrite match attempts : 186617
% 49.91/7.92 % BW rewrite match successes : 16
% 49.91/7.92 % Condensation attempts : 0
% 49.91/7.92 % Condensation successes : 0
% 49.91/7.92 % Termbank termtop insertions : 5113763
% 49.91/7.92 % Search garbage collected termcells : 11
% 49.91/7.92
% 49.91/7.92 % -------------------------------------------------
% 49.91/7.92 % User time : 6.805 s
% 49.91/7.92 % System time : 0.297 s
% 49.91/7.92 % Total time : 7.101 s
% 49.91/7.92 % Maximum resident set size: 3332 pages
% 49.91/7.92
% 49.91/7.92 % -------------------------------------------------
% 49.91/7.92 % User time : 33.885 s
% 49.91/7.92 % System time : 1.288 s
% 49.91/7.92 % Total time : 35.172 s
% 49.91/7.92 % Maximum resident set size: 4864 pages
% 49.91/7.92 % E exiting
%------------------------------------------------------------------------------