%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:17 PM UTC 2026
% Result : Unsatisfiable 68.13s 10.87s
% Output : CNFRefutation 68.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 9
% Syntax : Number of clauses : 51 ( 14 unt; 0 nHn; 31 RR)
% Number of literals : 98 ( 0 equ; 50 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 123 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
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_3,axiom,
axiom(or(not(X1),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).
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(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_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).
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(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL003-0.ax',rule_1) ).
cnf(prove_this,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_9,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ axiom(or(not(X2),X1))
| theorem(X1) ),
c_0_9 ).
cnf(c_0_11,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_12,axiom,
axiom(or(not(X1),or(X2,X1))),
axiom_1_3 ).
cnf(c_0_13,axiom,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_14,axiom,
axiom(or(not(or(X1,X1)),X1)),
axiom_1_2 ).
cnf(c_0_15,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_17,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_18,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_13]) ).
cnf(c_0_19,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_20,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_22,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(X1,or(not(or(X1,X2)),X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_23,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_24,plain,
( ~ theorem(or(or(X1,X2),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(or(not(or(X1,X2)),X3),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( ~ theorem(or(not(X3),X2))
| ~ axiom(or(not(X1),X3))
| theorem(or(not(X1),X2)) ),
c_0_23 ).
cnf(c_0_27,plain,
( ~ theorem(or(not(X2),X1))
| theorem(or(not(or(X1,X2)),X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ theorem(or(X3,X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_29,plain,
( ~ axiom(or(not(X1),or(X2,X3)))
| ~ theorem(or(not(X3),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ theorem(or(or(X1,X4),X3))
| theorem(or(X1,or(or(X2,X3),X4))) ),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_31,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_32,plain,
( ~ theorem(or(not(or(X1,X3)),X2))
| theorem(or(not(or(X1,or(X2,X3))),X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_11]) ).
cnf(c_0_33,plain,
( ~ theorem(or(or(or(or(X1,X2),X3),X3),X2))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_34,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_31 ).
cnf(c_0_35,plain,
( ~ axiom(or(not(X1),or(X3,or(X2,X4))))
| ~ theorem(or(not(or(X3,X4)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_36,plain,
( ~ theorem(or(X2,X3))
| theorem(or(or(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_33,c_0_28]) ).
cnf(c_0_37,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_34]) ).
cnf(c_0_38,plain,
( ~ theorem(or(not(or(X3,X2)),X1))
| theorem(or(not(or(or(X1,X2),X3)),X1)) ),
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_39,plain,
( ~ theorem(or(X3,X1))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_21,c_0_36]) ).
cnf(c_0_40,plain,
( ~ axiom(or(not(X1),X4))
| ~ axiom(or(X2,or(not(X4),X3)))
| theorem(or(not(X1),or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_26,c_0_37]) ).
cnf(c_0_41,plain,
( ~ axiom(or(not(X1),or(or(X2,X4),X3)))
| ~ theorem(or(not(or(X3,X4)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_42,plain,
( ~ theorem(or(X3,or(X1,or(X2,X3))))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_24,c_0_39]) ).
cnf(c_0_43,plain,
( ~ axiom(or(not(X1),or(X4,X2)))
| theorem(or(not(X1),or(not(or(not(X2),X3)),or(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_40,c_0_13]) ).
cnf(c_0_44,plain,
( ~ theorem(or(not(or(X1,X3)),X2))
| theorem(or(not(X1),X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_45,plain,
( ~ axiom(or(not(X2),or(X3,X1)))
| theorem(or(not(or(not(X1),not(X2))),or(X3,not(X2)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_47,plain,
( ~ axiom(or(not(X3),or(X2,X1)))
| theorem(or(not(not(X1)),or(X2,not(X3)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
~ theorem(or(not(or(not(p),q)),or(not(not(or(not(p),not(r)))),not(or(not(q),not(r)))))),
c_0_46 ).
cnf(c_0_49,plain,
( ~ axiom(or(not(X3),or(X1,X2)))
| theorem(or(X1,or(not(not(X2)),not(X3)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL253-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.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.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 00:17:58 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 68.13/10.87 % Version: 3.5.1
% 68.13/10.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 68.13/10.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.13/10.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 68.13/10.87 % Starting new_bool_3 with 300s (1) cores
% 68.13/10.87 % Starting new_bool_1 with 300s (1) cores
% 68.13/10.87 % Starting sh5l with 300s (1) cores
% 68.13/10.87 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 564336 completed with status 0
% 68.13/10.87 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 68.13/10.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 68.13/10.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.13/10.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 68.13/10.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 68.13/10.87 % No SInE strategy applied
% 68.13/10.87 % Search class: FHUNM-FFSF21-DFFFFFNN
% 68.13/10.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 68.13/10.87 % Starting SubtermCWHack with 136s (1) cores
% 68.13/10.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 68.13/10.87 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 68.13/10.87 % Starting new_bool_3 with 296s (1) cores
% 68.13/10.87 % Starting new_bool_1 with 291s (1) cores
% 68.13/10.87 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 564343 completed with status 0
% 68.13/10.87 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 68.13/10.87 % Preprocessing class: FSMSSMSSSSSNFFN.
% 68.13/10.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 68.13/10.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 68.13/10.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 68.13/10.87 % No SInE strategy applied
% 68.13/10.87 % Search class: FHUNM-FFSF21-DFFFFFNN
% 68.13/10.87 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 68.13/10.87 % Starting SubtermCWHack with 136s (1) cores
% 68.13/10.87 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 68.13/10.87 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 300s (1) cores
% 68.13/10.87 % Preprocessing time : 0.026 s
% 68.13/10.87
% 68.13/10.87 % Proof found!
% 68.13/10.87 % SZS status Unsatisfiable
% 68.13/10.87 % SZS output start CNFRefutation
% See solution above
% 68.13/10.88 % Parsed axioms : 9
% 68.13/10.88 % Removed by relevancy pruning/SinE : 0
% 68.13/10.88 % Initial clauses : 9
% 68.13/10.88 % Removed in clause preprocessing : 0
% 68.13/10.88 % Initial clauses in saturation : 9
% 68.13/10.88 % Processed clauses : 13323
% 68.13/10.88 % ...of these trivial : 894
% 68.13/10.88 % ...subsumed : 8376
% 68.13/10.88 % ...remaining for further processing : 4053
% 68.13/10.88 % Other redundant clauses eliminated : 0
% 68.13/10.88 % Clauses deleted for lack of memory : 0
% 68.13/10.88 % Backward-subsumed : 68
% 68.13/10.88 % Backward-rewritten : 7
% 68.13/10.88 % Generated clauses : 193225
% 68.13/10.88 % ...of the previous two non-redundant : 169034
% 68.13/10.88 % ...aggressively subsumed : 0
% 68.13/10.88 % Contextual simplify-reflections : 0
% 68.13/10.88 % Paramodulations : 193225
% 68.13/10.88 % Factorizations : 0
% 68.13/10.88 % NegExts : 0
% 68.13/10.88 % Equation resolutions : 0
% 68.13/10.88 % Disequality decompositions : 0
% 68.13/10.88 % Total rewrite steps : 24934
% 68.13/10.88 % ...of those cached : 17093
% 68.13/10.88 % Propositional unsat checks : 0
% 68.13/10.88 % Propositional check models : 0
% 68.13/10.88 % Propositional check unsatisfiable : 0
% 68.13/10.88 % Propositional clauses : 0
% 68.13/10.88 % Propositional clauses after purity: 0
% 68.13/10.88 % Propositional unsat core size : 0
% 68.13/10.88 % Propositional preprocessing time : 0.000
% 68.13/10.88 % Propositional encoding time : 0.000
% 68.13/10.88 % Propositional solver time : 0.000
% 68.13/10.88 % Success case prop preproc time : 0.000
% 68.13/10.88 % Success case prop encoding time : 0.000
% 68.13/10.88 % Success case prop solver time : 0.000
% 68.13/10.88 % Current number of processed clauses : 3978
% 68.13/10.88 % Positive orientable unit clauses : 674
% 68.13/10.88 % Positive unorientable unit clauses: 0
% 68.13/10.88 % Negative unit clauses : 64
% 68.13/10.88 % Non-unit-clauses : 3240
% 68.13/10.88 % Current number of unprocessed clauses: 155545
% 68.13/10.88 % ...number of literals in the above : 299137
% 68.13/10.88 % Current number of archived formulas : 0
% 68.13/10.88 % Current number of archived clauses : 75
% 68.13/10.88 % Clause-clause subsumption calls (NU) : 1806467
% 68.13/10.88 % Rec. Clause-clause subsumption calls : 1802319
% 68.13/10.88 % Non-unit clause-clause subsumptions : 8344
% 68.13/10.88 % Unit Clause-clause subsumption calls : 174294
% 68.13/10.88 % Rewrite failures with RHS unbound : 0
% 68.13/10.88 % BW rewrite match attempts : 230510
% 68.13/10.88 % BW rewrite match successes : 9
% 68.13/10.88 % Condensation attempts : 0
% 68.13/10.88 % Condensation successes : 0
% 68.13/10.88 % Termbank termtop insertions : 3672029
% 68.13/10.88 % Search garbage collected termcells : 17
% 68.13/10.88
% 68.13/10.88 % -------------------------------------------------
% 68.13/10.88 % User time : 8.978 s
% 68.13/10.88 % System time : 0.311 s
% 68.13/10.88 % Total time : 9.289 s
% 68.13/10.88 % Maximum resident set size: 3644 pages
% 68.13/10.88
% 68.13/10.88 % -------------------------------------------------
% 68.13/10.88 % User time : 47.361 s
% 68.13/10.88 % System time : 1.329 s
% 68.13/10.88 % Total time : 48.691 s
% 68.13/10.88 % Maximum resident set size: 4608 pages
% 68.13/10.88 % E exiting
%------------------------------------------------------------------------------