%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL185-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 : n004.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:00 PM UTC 2026
% Result : Unsatisfiable 0.69s 0.51s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of clauses : 33 ( 20 unt; 0 nHn; 16 RR)
% Number of literals : 51 ( 2 equ; 22 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 : 60 ( 6 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_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
~ theorem(implies(p,or(p,q))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_7,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_8,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_7 ).
cnf(c_0_9,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_10,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_11,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_10 ).
cnf(c_0_13,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_14,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_15,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,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_13,c_0_9]),c_0_9]),c_0_9]) ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_14,c_0_9]) ).
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_15,c_0_16]) ).
cnf(c_0_19,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_21,plain,
( ~ axiom(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_22,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_23,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_9]) ).
cnf(c_0_24,negated_conjecture,
~ theorem(implies(p,or(p,q))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X1,or(X3,X2)))),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_26,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ theorem(implies(p,or(p,q))),
c_0_24 ).
cnf(c_0_28,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_29,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
~ theorem(or(not(p),or(p,q))),
inference(rw,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),or(X1,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL185-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 00:09:51 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 0.69/0.51 % Version: 3.5.1
% 0.69/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.69/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.69/0.51 % Starting sh5l with 300s (1) cores
% 0.69/0.51 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1842409 completed with status 0
% 0.69/0.51 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.69/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.51 % No SInE strategy applied
% 0.69/0.51 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.69/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.69/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.69/0.51 % Starting new_bool_1 with 136s (1) cores
% 0.69/0.51 % new_bool_3 with pid 1842418 completed with status 0
% 0.69/0.51 % Result found by new_bool_3
% 0.69/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.69/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.69/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.51 % No SInE strategy applied
% 0.69/0.51 % Search class: FHUNM-FFSF21-MFFFFFNN
% 0.69/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.69/0.51 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.69/0.51 % Starting new_bool_3 with 136s (1) cores
% 0.69/0.51 % Preprocessing time : 0.001 s
% 0.69/0.51 % Presaturation interreduction done
% 0.69/0.51
% 0.69/0.51 % Proof found!
% 0.69/0.51 % SZS status Unsatisfiable
% 0.69/0.51 % SZS output start CNFRefutation
% See solution above
% 0.69/0.51 % Parsed axioms : 9
% 0.69/0.51 % Removed by relevancy pruning/SinE : 0
% 0.69/0.51 % Initial clauses : 9
% 0.69/0.51 % Removed in clause preprocessing : 1
% 0.69/0.51 % Initial clauses in saturation : 8
% 0.69/0.51 % Processed clauses : 815
% 0.69/0.51 % ...of these trivial : 29
% 0.69/0.51 % ...subsumed : 452
% 0.69/0.51 % ...remaining for further processing : 334
% 0.69/0.51 % Other redundant clauses eliminated : 0
% 0.69/0.51 % Clauses deleted for lack of memory : 0
% 0.69/0.51 % Backward-subsumed : 3
% 0.69/0.51 % Backward-rewritten : 2
% 0.69/0.51 % Generated clauses : 3163
% 0.69/0.51 % ...of the previous two non-redundant : 2815
% 0.69/0.51 % ...aggressively subsumed : 0
% 0.69/0.51 % Contextual simplify-reflections : 0
% 0.69/0.51 % Paramodulations : 3163
% 0.69/0.51 % Factorizations : 0
% 0.69/0.51 % NegExts : 0
% 0.69/0.51 % Equation resolutions : 0
% 0.69/0.51 % Disequality decompositions : 0
% 0.69/0.51 % Total rewrite steps : 343
% 0.69/0.51 % ...of those cached : 215
% 0.69/0.51 % Propositional unsat checks : 0
% 0.69/0.51 % Propositional check models : 0
% 0.69/0.51 % Propositional check unsatisfiable : 0
% 0.69/0.51 % Propositional clauses : 0
% 0.69/0.51 % Propositional clauses after purity: 0
% 0.69/0.51 % Propositional unsat core size : 0
% 0.69/0.51 % Propositional preprocessing time : 0.000
% 0.69/0.51 % Propositional encoding time : 0.000
% 0.69/0.51 % Propositional solver time : 0.000
% 0.69/0.51 % Success case prop preproc time : 0.000
% 0.69/0.51 % Success case prop encoding time : 0.000
% 0.69/0.51 % Success case prop solver time : 0.000
% 0.69/0.51 % Current number of processed clauses : 321
% 0.69/0.51 % Positive orientable unit clauses : 110
% 0.69/0.51 % Positive unorientable unit clauses: 0
% 0.69/0.51 % Negative unit clauses : 9
% 0.69/0.51 % Non-unit-clauses : 202
% 0.69/0.51 % Current number of unprocessed clauses: 2015
% 0.69/0.51 % ...number of literals in the above : 2767
% 0.69/0.51 % Current number of archived formulas : 0
% 0.69/0.51 % Current number of archived clauses : 14
% 0.69/0.51 % Clause-clause subsumption calls (NU) : 5276
% 0.69/0.51 % Rec. Clause-clause subsumption calls : 5276
% 0.69/0.51 % Non-unit clause-clause subsumptions : 453
% 0.69/0.51 % Unit Clause-clause subsumption calls : 261
% 0.69/0.51 % Rewrite failures with RHS unbound : 0
% 0.69/0.51 % BW rewrite match attempts : 2042
% 0.69/0.51 % BW rewrite match successes : 2
% 0.69/0.51 % Condensation attempts : 0
% 0.69/0.51 % Condensation successes : 0
% 0.69/0.51 % Termbank termtop insertions : 39425
% 0.69/0.51 % Search garbage collected termcells : 11
% 0.69/0.51
% 0.69/0.51 % -------------------------------------------------
% 0.69/0.51 % User time : 0.055 s
% 0.69/0.51 % System time : 0.009 s
% 0.69/0.51 % Total time : 0.064 s
% 0.69/0.51 % Maximum resident set size: 3384 pages
% 0.69/0.51
% 0.69/0.51 % -------------------------------------------------
% 0.69/0.51 % User time : 0.266 s
% 0.69/0.51 % System time : 0.030 s
% 0.69/0.51 % Total time : 0.296 s
% 0.69/0.51 % Maximum resident set size: 4608 pages
% 0.69/0.51 % E exiting
%------------------------------------------------------------------------------