%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL227-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 : n003.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:11 PM UTC 2026
% Result : Unsatisfiable 13.26s 2.47s
% Output : CNFRefutation 13.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of clauses : 57 ( 27 unt; 0 nHn; 30 RR)
% Number of literals : 97 ( 2 equ; 49 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 111 ( 8 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_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_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(prove_this,negated_conjecture,
~ theorem(implies(implies(q,implies(r,s)),implies(or(p,q),implies(or(p,r),or(p,s))))),
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(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_17,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,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_15,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_20,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_21,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_22,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_24,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_25,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_27,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_22]) ).
cnf(c_0_28,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_29,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_30,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
~ theorem(implies(implies(q,implies(r,s)),implies(or(p,q),implies(or(p,r),or(p,s))))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_32,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_33,plain,
( ~ theorem(or(X1,X2))
| ~ theorem(or(not(X3),X4))
| theorem(or(X1,or(not(or(not(X2),X3)),X4))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_35,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
~ theorem(implies(implies(q,implies(r,s)),implies(or(p,q),implies(or(p,r),or(p,s))))),
c_0_31 ).
cnf(c_0_37,plain,
( ~ theorem(or(not(X2),X3))
| ~ theorem(or(or(not(or(not(X1),X2)),X3),X1))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ theorem(or(not(or(not(q),or(not(r),s))),or(not(or(p,q)),or(not(or(p,r)),or(p,s))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_11]),c_0_11]),c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X2),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( ~ theorem(or(q,or(not(or(p,q)),or(not(or(p,r)),or(p,s)))))
| ~ theorem(or(not(or(not(r),s)),or(not(or(p,q)),or(not(or(p,r)),or(p,s))))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_43,negated_conjecture,
( ~ theorem(or(not(or(not(r),s)),or(not(or(p,r)),or(p,s))))
| ~ theorem(or(q,or(not(or(p,q)),or(not(or(p,r)),or(p,s))))) ),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_44,plain,
( ~ theorem(or(X1,or(X3,or(X2,X4))))
| theorem(or(X1,or(X2,or(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_19]) ).
cnf(c_0_45,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_46,negated_conjecture,
~ theorem(or(q,or(not(or(p,q)),or(not(or(p,r)),or(p,s))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_14]),c_0_18])]) ).
cnf(c_0_47,plain,
( ~ theorem(or(X1,or(X2,X4)))
| theorem(or(X1,or(X2,or(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_48,plain,
( ~ axiom(or(X1,or(or(X1,X2),X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ theorem(or(q,or(not(or(p,q)),or(p,s)))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,plain,
( ~ theorem(or(X1,or(not(X3),X4)))
| theorem(or(X1,or(not(or(X2,X3)),or(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_18]) ).
cnf(c_0_51,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_42,c_0_29]) ).
cnf(c_0_52,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_48,c_0_25]) ).
cnf(c_0_53,negated_conjecture,
~ theorem(or(q,or(not(q),s))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_54,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_51,c_0_35]) ).
cnf(c_0_55,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_34,c_0_52]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL227-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.18/0.42 % Computer : n003.cluster.edu
% 0.18/0.42 % Model : x86_64 x86_64
% 0.18/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42 % Memory : 8046.5625MB
% 0.18/0.42 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 00:14:16 UTC 2026
% 0.18/0.43 % CPUTime :
% 0.18/0.43 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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
% 13.26/2.47 % Version: 3.5.1
% 13.26/2.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.26/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.26/2.47 % Starting new_bool_3 with 300s (1) cores
% 13.26/2.47 % Starting new_bool_1 with 300s (1) cores
% 13.26/2.47 % Starting sh5l with 300s (1) cores
% 13.26/2.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 2989870 completed with status 0
% 13.26/2.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 13.26/2.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.26/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.26/2.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.26/2.47 % No SInE strategy applied
% 13.26/2.47 % Search class: FHUNM-FFSF21-MFFFFFNN
% 13.26/2.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.26/2.47 % Starting SubtermCWHack with 136s (1) cores
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 13.26/2.47 % Starting new_bool_3 with 136s (1) cores
% 13.26/2.47 % Starting new_bool_1 with 136s (1) cores
% 13.26/2.47 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 2989877 completed with status 0
% 13.26/2.47 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 13.26/2.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 13.26/2.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 13.26/2.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 13.26/2.47 % No SInE strategy applied
% 13.26/2.47 % Search class: FHUNM-FFSF21-MFFFFFNN
% 13.26/2.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 13.26/2.47 % Starting SubtermCWHack with 136s (1) cores
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 13.26/2.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 13.26/2.47 % Preprocessing time : 0.043 s
% 13.26/2.47
% 13.26/2.47 % Proof found!
% 13.26/2.47 % SZS status Unsatisfiable
% 13.26/2.47 % SZS output start CNFRefutation
% See solution above
% 13.26/2.47 % Parsed axioms : 9
% 13.26/2.47 % Removed by relevancy pruning/SinE : 0
% 13.26/2.47 % Initial clauses : 9
% 13.26/2.47 % Removed in clause preprocessing : 1
% 13.26/2.47 % Initial clauses in saturation : 8
% 13.26/2.47 % Processed clauses : 4255
% 13.26/2.47 % ...of these trivial : 7
% 13.26/2.47 % ...subsumed : 2363
% 13.26/2.47 % ...remaining for further processing : 1885
% 13.26/2.47 % Other redundant clauses eliminated : 0
% 13.26/2.47 % Clauses deleted for lack of memory : 0
% 13.26/2.47 % Backward-subsumed : 420
% 13.26/2.47 % Backward-rewritten : 0
% 13.26/2.47 % Generated clauses : 44474
% 13.26/2.47 % ...of the previous two non-redundant : 44134
% 13.26/2.47 % ...aggressively subsumed : 0
% 13.26/2.47 % Contextual simplify-reflections : 0
% 13.26/2.47 % Paramodulations : 44474
% 13.26/2.47 % Factorizations : 0
% 13.26/2.47 % NegExts : 0
% 13.26/2.47 % Equation resolutions : 0
% 13.26/2.47 % Disequality decompositions : 0
% 13.26/2.47 % Total rewrite steps : 295
% 13.26/2.47 % ...of those cached : 209
% 13.26/2.47 % Propositional unsat checks : 0
% 13.26/2.47 % Propositional check models : 0
% 13.26/2.47 % Propositional check unsatisfiable : 0
% 13.26/2.47 % Propositional clauses : 0
% 13.26/2.47 % Propositional clauses after purity: 0
% 13.26/2.47 % Propositional unsat core size : 0
% 13.26/2.47 % Propositional preprocessing time : 0.000
% 13.26/2.47 % Propositional encoding time : 0.000
% 13.26/2.47 % Propositional solver time : 0.000
% 13.26/2.47 % Success case prop preproc time : 0.000
% 13.26/2.47 % Success case prop encoding time : 0.000
% 13.26/2.47 % Success case prop solver time : 0.000
% 13.26/2.47 % Current number of processed clauses : 1465
% 13.26/2.47 % Positive orientable unit clauses : 18
% 13.26/2.47 % Positive unorientable unit clauses: 0
% 13.26/2.47 % Negative unit clauses : 488
% 13.26/2.47 % Non-unit-clauses : 959
% 13.26/2.47 % Current number of unprocessed clauses: 39125
% 13.26/2.47 % ...number of literals in the above : 132716
% 13.26/2.47 % Current number of archived formulas : 0
% 13.26/2.47 % Current number of archived clauses : 421
% 13.26/2.47 % Clause-clause subsumption calls (NU) : 175735
% 13.26/2.47 % Rec. Clause-clause subsumption calls : 157160
% 13.26/2.47 % Non-unit clause-clause subsumptions : 1084
% 13.26/2.47 % Unit Clause-clause subsumption calls : 31445
% 13.26/2.47 % Rewrite failures with RHS unbound : 0
% 13.26/2.47 % BW rewrite match attempts : 465
% 13.26/2.47 % BW rewrite match successes : 2
% 13.26/2.47 % Condensation attempts : 0
% 13.26/2.47 % Condensation successes : 0
% 13.26/2.47 % Termbank termtop insertions : 865331
% 13.26/2.47 % Search garbage collected termcells : 11
% 13.26/2.47
% 13.26/2.47 % -------------------------------------------------
% 13.26/2.47 % User time : 1.825 s
% 13.26/2.47 % System time : 0.076 s
% 13.26/2.47 % Total time : 1.900 s
% 13.26/2.47 % Maximum resident set size: 3640 pages
% 13.26/2.47
% 13.26/2.47 % -------------------------------------------------
% 13.26/2.47 % User time : 9.117 s
% 13.26/2.47 % System time : 0.425 s
% 13.26/2.47 % Total time : 9.543 s
% 13.26/2.47 % Maximum resident set size: 4864 pages
% 13.26/2.47 % E exiting
%------------------------------------------------------------------------------