%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL227-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 27.53s 4.58s
% Output : CNFRefutation 27.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of clauses : 51 ( 25 unt; 0 nHn; 25 RR)
% Number of literals : 83 ( 0 equ; 36 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 121 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_3,axiom,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
cnf(axiom_1_2,axiom,
axiom(or(not(or(X1,X1)),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).
cnf(prove_this,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))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
inference(fof_simplification,[status(thm)],[rule_3]) ).
cnf(c_0_10,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_9 ).
cnf(c_0_11,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_12,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_13,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_14,plain,
( ~ theorem(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_12 ).
cnf(c_0_16,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_13 ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_18,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_19,plain,
( ~ axiom(or(not(or(X3,X1)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_21,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_22,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_23,plain,
( ~ theorem(or(not(or(X2,X1)),X3))
| theorem(or(not(or(X1,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
cnf(c_0_24,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_25,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_26,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_28,plain,
theorem(or(not(or(X1,X2)),or(or(X2,X1),X3))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_31,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_32,plain,
theorem(or(not(X1),or(or(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_33,plain,
( ~ theorem(or(or(X1,or(X2,X3)),X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_34,plain,
( ~ theorem(or(not(X3),X2))
| theorem(or(or(X1,X2),not(or(X1,X3)))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
theorem(or(not(or(X1,X2)),or(or(or(X2,X1),X3),X4))),
inference(spm,[status(thm)],[c_0_23,c_0_32]) ).
cnf(c_0_36,plain,
( ~ theorem(or(not(X3),or(X2,not(or(X1,X3)))))
| theorem(or(X1,or(X2,not(or(X1,X3))))) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
theorem(or(not(X1),or(or(or(X1,X2),X3),X4))),
inference(spm,[status(thm)],[c_0_14,c_0_35]) ).
cnf(c_0_38,plain,
theorem(or(X1,or(or(or(X2,X3),X4),not(or(X1,X2))))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,plain,
theorem(or(or(or(X1,X2),X3),or(X4,not(or(X4,X1))))),
inference(spm,[status(thm)],[c_0_21,c_0_38]) ).
cnf(c_0_40,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(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_41,plain,
( ~ theorem(or(not(or(not(or(X4,X1)),or(X4,X2))),X3))
| theorem(or(not(or(not(X1),X2)),X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_27]) ).
cnf(c_0_42,plain,
theorem(or(or(X1,X2),not(or(or(X1,X2),X1)))),
inference(spm,[status(thm)],[c_0_25,c_0_39]) ).
cnf(c_0_43,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))))),
c_0_40 ).
cnf(c_0_44,plain,
( ~ theorem(or(not(or(X3,X2)),X4))
| theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),X4))) ),
inference(spm,[status(thm)],[c_0_41,c_0_31]) ).
cnf(c_0_45,plain,
( ~ theorem(or(not(or(X2,or(X1,X3))),X4))
| theorem(or(not(or(X1,or(X2,X3))),X4)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_46,plain,
theorem(or(not(or(or(X1,X2),X1)),or(X1,X2))),
inference(spm,[status(thm)],[c_0_30,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
~ theorem(or(not(or(p,or(not(r),s))),or(not(or(p,r)),or(p,s)))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( ~ theorem(or(not(or(X4,or(X1,X3))),X5))
| theorem(or(not(or(X1,or(not(X2),X3))),or(not(or(X4,X2)),X5))) ),
inference(spm,[status(thm)],[c_0_45,c_0_44]) ).
cnf(c_0_49,plain,
theorem(or(not(or(X1,or(X1,X2))),or(X1,X2))),
inference(spm,[status(thm)],[c_0_23,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 : LCL227-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n017.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % 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:07:57 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.51 Running first-order theorem proving
% 0.23/0.51 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
% 27.53/4.58 % Version: 3.5.1
% 27.53/4.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.53/4.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.53/4.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.53/4.58 % Starting new_bool_3 with 300s (1) cores
% 27.53/4.58 % Starting new_bool_1 with 300s (1) cores
% 27.53/4.58 % Starting sh5l with 300s (1) cores
% 27.53/4.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 997187 completed with status 0
% 27.53/4.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 27.53/4.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.53/4.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.53/4.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.53/4.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.53/4.58 % No SInE strategy applied
% 27.53/4.58 % Search class: FHUNM-FFSF21-MFFFFFNN
% 27.53/4.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 27.53/4.58 % Starting SubtermCWHack with 136s (1) cores
% 27.53/4.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 27.53/4.58 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 27.53/4.58 % Starting new_bool_3 with 136s (1) cores
% 27.53/4.58 % Starting new_bool_1 with 136s (1) cores
% 27.53/4.58 % SubtermCWHack with pid 997191 completed with status 0
% 27.53/4.58 % Result found by SubtermCWHack
% 27.53/4.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 27.53/4.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.53/4.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 27.53/4.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.53/4.58 % No SInE strategy applied
% 27.53/4.58 % Search class: FHUNM-FFSF21-MFFFFFNN
% 27.53/4.58 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 27.53/4.58 % Starting SubtermCWHack with 136s (1) cores
% 27.53/4.58 % Preprocessing time : 0.001 s
% 27.53/4.58
% 27.53/4.58 % Proof found!
% 27.53/4.58 % SZS status Unsatisfiable
% 27.53/4.58 % SZS output start CNFRefutation
% See solution above
% 27.53/4.58 % Parsed axioms : 9
% 27.53/4.58 % Removed by relevancy pruning/SinE : 0
% 27.53/4.58 % Initial clauses : 9
% 27.53/4.58 % Removed in clause preprocessing : 0
% 27.53/4.58 % Initial clauses in saturation : 9
% 27.53/4.58 % Processed clauses : 15466
% 27.53/4.58 % ...of these trivial : 2239
% 27.53/4.58 % ...subsumed : 7230
% 27.53/4.58 % ...remaining for further processing : 5997
% 27.53/4.58 % Other redundant clauses eliminated : 0
% 27.53/4.58 % Clauses deleted for lack of memory : 0
% 27.53/4.58 % Backward-subsumed : 6
% 27.53/4.58 % Backward-rewritten : 7
% 27.53/4.58 % Generated clauses : 206268
% 27.53/4.58 % ...of the previous two non-redundant : 153064
% 27.53/4.58 % ...aggressively subsumed : 0
% 27.53/4.58 % Contextual simplify-reflections : 0
% 27.53/4.58 % Paramodulations : 206268
% 27.53/4.58 % Factorizations : 0
% 27.53/4.58 % NegExts : 0
% 27.53/4.58 % Equation resolutions : 0
% 27.53/4.58 % Disequality decompositions : 0
% 27.53/4.58 % Total rewrite steps : 55422
% 27.53/4.58 % ...of those cached : 37816
% 27.53/4.58 % Propositional unsat checks : 0
% 27.53/4.58 % Propositional check models : 0
% 27.53/4.58 % Propositional check unsatisfiable : 0
% 27.53/4.58 % Propositional clauses : 0
% 27.53/4.58 % Propositional clauses after purity: 0
% 27.53/4.58 % Propositional unsat core size : 0
% 27.53/4.58 % Propositional preprocessing time : 0.000
% 27.53/4.58 % Propositional encoding time : 0.000
% 27.53/4.58 % Propositional solver time : 0.000
% 27.53/4.58 % Success case prop preproc time : 0.000
% 27.53/4.58 % Success case prop encoding time : 0.000
% 27.53/4.58 % Success case prop solver time : 0.000
% 27.53/4.58 % Current number of processed clauses : 5984
% 27.53/4.58 % Positive orientable unit clauses : 4618
% 27.53/4.58 % Positive unorientable unit clauses: 0
% 27.53/4.58 % Negative unit clauses : 238
% 27.53/4.58 % Non-unit-clauses : 1128
% 27.53/4.58 % Current number of unprocessed clauses: 137545
% 27.53/4.58 % ...number of literals in the above : 166125
% 27.53/4.58 % Current number of archived formulas : 0
% 27.53/4.58 % Current number of archived clauses : 13
% 27.53/4.58 % Clause-clause subsumption calls (NU) : 683686
% 27.53/4.58 % Rec. Clause-clause subsumption calls : 683686
% 27.53/4.58 % Non-unit clause-clause subsumptions : 6590
% 27.53/4.58 % Unit Clause-clause subsumption calls : 66279
% 27.53/4.58 % Rewrite failures with RHS unbound : 0
% 27.53/4.58 % BW rewrite match attempts : 4045222
% 27.53/4.58 % BW rewrite match successes : 7
% 27.53/4.58 % Condensation attempts : 0
% 27.53/4.58 % Condensation successes : 0
% 27.53/4.58 % Termbank termtop insertions : 2959262
% 27.53/4.58 % Search garbage collected termcells : 17
% 27.53/4.58
% 27.53/4.58 % -------------------------------------------------
% 27.53/4.58 % User time : 3.784 s
% 27.53/4.58 % System time : 0.144 s
% 27.53/4.58 % Total time : 3.928 s
% 27.53/4.58 % Maximum resident set size: 3644 pages
% 27.53/4.58
% 27.53/4.58 % -------------------------------------------------
% 27.53/4.58 % User time : 18.794 s
% 27.53/4.58 % System time : 0.625 s
% 27.53/4.58 % Total time : 19.419 s
% 27.53/4.58 % Maximum resident set size: 4608 pages
% 27.53/4.58 % E exiting
%------------------------------------------------------------------------------