%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL259-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 : 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:18 PM UTC 2026
% Result : Unsatisfiable 6.35s 1.41s
% Output : CNFRefutation 6.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of clauses : 51 ( 27 unt; 0 nHn; 25 RR)
% Number of literals : 83 ( 2 equ; 36 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 : 101 ( 10 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(implies(p,implies(p,q)),implies(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,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_22,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_23,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_24,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_25,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_21,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
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_25]) ).
cnf(c_0_29,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_31,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_28]) ).
cnf(c_0_32,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_33,plain,
( ~ axiom(or(X2,or(or(X1,or(X2,X3)),X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_31,c_0_14]) ).
cnf(c_0_35,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_32,c_0_11]) ).
cnf(c_0_36,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_37,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_23,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(implies(implies(p,implies(p,q)),implies(p,q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_40,plain,
( ~ axiom(or(X1,or(not(X3),X2)))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_30]) ).
cnf(c_0_41,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ theorem(implies(implies(p,implies(p,q)),implies(p,q))),
c_0_39 ).
cnf(c_0_43,plain,
( ~ theorem(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_34,c_0_22]) ).
cnf(c_0_44,plain,
( ~ theorem(or(X3,X1))
| theorem(or(not(or(not(X1),X2)),or(X3,X2))) ),
inference(spm,[status(thm)],[c_0_40,c_0_25]) ).
cnf(c_0_45,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_46,plain,
theorem(or(X1,or(not(X1),X2))),
inference(spm,[status(thm)],[c_0_23,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
~ theorem(or(not(or(not(p),or(not(p),q))),or(not(p),q))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_48,plain,
( ~ theorem(or(X2,X1))
| theorem(or(not(or(not(X1),X2)),X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
theorem(or(or(not(X1),X2),X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL259-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 % Computer : n026.cluster.edu
% 0.16/0.42 % Model : x86_64 x86_64
% 0.16/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.42 % Memory : 8046.5625MB
% 0.16/0.42 % OS : Linux 6.8.0-71-generic
% 0.16/0.42 % CPULimit : 300
% 0.16/0.42 % WCLimit : 300
% 0.16/0.42 % DateTime : Mon Sep 21 00:18:51 UTC 2026
% 0.16/0.42 % CPUTime :
% 0.16/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.49 Running first-order theorem proving
% 0.16/0.49 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
% 6.35/1.41 % Version: 3.5.1
% 6.35/1.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.35/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.35/1.41 % Starting new_bool_3 with 300s (1) cores
% 6.35/1.41 % Starting new_bool_1 with 300s (1) cores
% 6.35/1.41 % Starting sh5l with 300s (1) cores
% 6.35/1.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 957999 completed with status 0
% 6.35/1.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.35/1.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.35/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.35/1.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.35/1.41 % No SInE strategy applied
% 6.35/1.41 % Search class: FHUNM-FFSF21-MFFFFFNN
% 6.35/1.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.35/1.41 % Starting SubtermCWHack with 136s (1) cores
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 6.35/1.41 % Starting new_bool_3 with 136s (1) cores
% 6.35/1.41 % Starting new_bool_1 with 136s (1) cores
% 6.35/1.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 958004 completed with status 0
% 6.35/1.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.35/1.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.35/1.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.35/1.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.35/1.41 % No SInE strategy applied
% 6.35/1.41 % Search class: FHUNM-FFSF21-MFFFFFNN
% 6.35/1.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 6.35/1.41 % Starting SubtermCWHack with 136s (1) cores
% 6.35/1.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.35/1.41 % Preprocessing time : 0.022 s
% 6.35/1.41
% 6.35/1.41 % Proof found!
% 6.35/1.41 % SZS status Unsatisfiable
% 6.35/1.41 % SZS output start CNFRefutation
% See solution above
% 6.35/1.41 % Parsed axioms : 9
% 6.35/1.41 % Removed by relevancy pruning/SinE : 0
% 6.35/1.41 % Initial clauses : 9
% 6.35/1.41 % Removed in clause preprocessing : 1
% 6.35/1.41 % Initial clauses in saturation : 8
% 6.35/1.41 % Processed clauses : 2201
% 6.35/1.41 % ...of these trivial : 21
% 6.35/1.41 % ...subsumed : 1454
% 6.35/1.41 % ...remaining for further processing : 726
% 6.35/1.41 % Other redundant clauses eliminated : 0
% 6.35/1.41 % Clauses deleted for lack of memory : 0
% 6.35/1.41 % Backward-subsumed : 11
% 6.35/1.41 % Backward-rewritten : 0
% 6.35/1.41 % Generated clauses : 23806
% 6.35/1.41 % ...of the previous two non-redundant : 23158
% 6.35/1.41 % ...aggressively subsumed : 0
% 6.35/1.41 % Contextual simplify-reflections : 0
% 6.35/1.41 % Paramodulations : 23806
% 6.35/1.41 % Factorizations : 0
% 6.35/1.41 % NegExts : 0
% 6.35/1.41 % Equation resolutions : 0
% 6.35/1.41 % Disequality decompositions : 0
% 6.35/1.41 % Total rewrite steps : 437
% 6.35/1.41 % ...of those cached : 347
% 6.35/1.41 % Propositional unsat checks : 0
% 6.35/1.41 % Propositional check models : 0
% 6.35/1.41 % Propositional check unsatisfiable : 0
% 6.35/1.41 % Propositional clauses : 0
% 6.35/1.41 % Propositional clauses after purity: 0
% 6.35/1.41 % Propositional unsat core size : 0
% 6.35/1.41 % Propositional preprocessing time : 0.000
% 6.35/1.41 % Propositional encoding time : 0.000
% 6.35/1.41 % Propositional solver time : 0.000
% 6.35/1.41 % Success case prop preproc time : 0.000
% 6.35/1.41 % Success case prop encoding time : 0.000
% 6.35/1.41 % Success case prop solver time : 0.000
% 6.35/1.41 % Current number of processed clauses : 715
% 6.35/1.41 % Positive orientable unit clauses : 45
% 6.35/1.41 % Positive unorientable unit clauses: 0
% 6.35/1.41 % Negative unit clauses : 44
% 6.35/1.41 % Non-unit-clauses : 626
% 6.35/1.41 % Current number of unprocessed clauses: 20908
% 6.35/1.41 % ...number of literals in the above : 63032
% 6.35/1.41 % Current number of archived formulas : 0
% 6.35/1.41 % Current number of archived clauses : 12
% 6.35/1.41 % Clause-clause subsumption calls (NU) : 56187
% 6.35/1.41 % Rec. Clause-clause subsumption calls : 51985
% 6.35/1.41 % Non-unit clause-clause subsumptions : 1416
% 6.35/1.41 % Unit Clause-clause subsumption calls : 1159
% 6.35/1.41 % Rewrite failures with RHS unbound : 0
% 6.35/1.41 % BW rewrite match attempts : 1187
% 6.35/1.41 % BW rewrite match successes : 2
% 6.35/1.41 % Condensation attempts : 0
% 6.35/1.41 % Condensation successes : 0
% 6.35/1.41 % Termbank termtop insertions : 404139
% 6.35/1.41 % Search garbage collected termcells : 11
% 6.35/1.41
% 6.35/1.41 % -------------------------------------------------
% 6.35/1.41 % User time : 0.840 s
% 6.35/1.41 % System time : 0.043 s
% 6.35/1.41 % Total time : 0.883 s
% 6.35/1.41 % Maximum resident set size: 3640 pages
% 6.35/1.41
% 6.35/1.41 % -------------------------------------------------
% 6.35/1.41 % User time : 4.115 s
% 6.35/1.41 % System time : 0.195 s
% 6.35/1.41 % Total time : 4.310 s
% 6.35/1.41 % Maximum resident set size: 4864 pages
% 6.35/1.41 % E exiting
%------------------------------------------------------------------------------