%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL237-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 : n008.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:13 PM UTC 2026
% Result : Unsatisfiable 1.51s 0.65s
% Output : CNFRefutation 1.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 18 unt; 0 nHn; 19 RR)
% Number of literals : 55 ( 4 equ; 26 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 0 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_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(q,implies(p,and(p,q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_8,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_9,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_8 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_11 ).
cnf(c_0_14,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_15,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
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_14,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_17,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_18,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_19,plain,
( ~ theorem(or(X1,X3))
| ~ theorem(or(not(X3),X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_17]) ).
cnf(c_0_20,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_22,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_23,plain,
( ~ axiom(or(not(X3),X2))
| ~ theorem(or(X1,X3))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_24,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_25,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ theorem(implies(q,implies(p,and(p,q)))),
c_0_22 ).
cnf(c_0_27,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_28,plain,
( ~ theorem(or(X1,or(X3,X2)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_30,negated_conjecture,
~ theorem(or(not(q),or(not(p),not(or(not(p),not(q)))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_10]),c_0_10]),c_0_27]) ).
cnf(c_0_31,plain,
( ~ axiom(or(X3,or(X1,X2)))
| theorem(or(X1,or(X2,X3))) ),
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)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL237-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n008.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.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 00:14:39 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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
% 1.51/0.65 % Version: 3.5.1
% 1.51/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.51/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.51/0.65 % Starting new_bool_3 with 300s (1) cores
% 1.51/0.65 % Starting new_bool_1 with 300s (1) cores
% 1.51/0.65 % Starting sh5l with 300s (1) cores
% 1.51/0.65 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3943541 completed with status 0
% 1.51/0.65 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.51/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.51/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.51/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.51/0.65 % No SInE strategy applied
% 1.51/0.65 % Search class: FHUNM-FFSF21-MFFFFFNN
% 1.51/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.51/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.51/0.65 % Starting new_bool_3 with 136s (1) cores
% 1.51/0.65 % Starting new_bool_1 with 136s (1) cores
% 1.51/0.65 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3943547 completed with status 0
% 1.51/0.65 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.51/0.65 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.51/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.51/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.51/0.65 % No SInE strategy applied
% 1.51/0.65 % Search class: FHUNM-FFSF21-MFFFFFNN
% 1.51/0.65 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.51/0.65 % Starting SubtermCWHack with 136s (1) cores
% 1.51/0.65 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.51/0.65 % Preprocessing time : 0.007 s
% 1.51/0.65
% 1.51/0.65 % Proof found!
% 1.51/0.65 % SZS status Unsatisfiable
% 1.51/0.65 % SZS output start CNFRefutation
% See solution above
% 1.51/0.65 % Parsed axioms : 10
% 1.51/0.65 % Removed by relevancy pruning/SinE : 0
% 1.51/0.65 % Initial clauses : 10
% 1.51/0.65 % Removed in clause preprocessing : 2
% 1.51/0.65 % Initial clauses in saturation : 8
% 1.51/0.65 % Processed clauses : 1200
% 1.51/0.65 % ...of these trivial : 8
% 1.51/0.65 % ...subsumed : 759
% 1.51/0.65 % ...remaining for further processing : 433
% 1.51/0.65 % Other redundant clauses eliminated : 0
% 1.51/0.65 % Clauses deleted for lack of memory : 0
% 1.51/0.65 % Backward-subsumed : 5
% 1.51/0.65 % Backward-rewritten : 0
% 1.51/0.65 % Generated clauses : 8768
% 1.51/0.65 % ...of the previous two non-redundant : 8450
% 1.51/0.65 % ...aggressively subsumed : 0
% 1.51/0.65 % Contextual simplify-reflections : 0
% 1.51/0.65 % Paramodulations : 8768
% 1.51/0.65 % Factorizations : 0
% 1.51/0.65 % NegExts : 0
% 1.51/0.65 % Equation resolutions : 0
% 1.51/0.65 % Disequality decompositions : 0
% 1.51/0.65 % Total rewrite steps : 174
% 1.51/0.65 % ...of those cached : 142
% 1.51/0.65 % Propositional unsat checks : 0
% 1.51/0.65 % Propositional check models : 0
% 1.51/0.65 % Propositional check unsatisfiable : 0
% 1.51/0.65 % Propositional clauses : 0
% 1.51/0.65 % Propositional clauses after purity: 0
% 1.51/0.65 % Propositional unsat core size : 0
% 1.51/0.65 % Propositional preprocessing time : 0.000
% 1.51/0.65 % Propositional encoding time : 0.000
% 1.51/0.65 % Propositional solver time : 0.000
% 1.51/0.65 % Success case prop preproc time : 0.000
% 1.51/0.65 % Success case prop encoding time : 0.000
% 1.51/0.65 % Success case prop solver time : 0.000
% 1.51/0.65 % Current number of processed clauses : 428
% 1.51/0.65 % Positive orientable unit clauses : 26
% 1.51/0.65 % Positive unorientable unit clauses: 0
% 1.51/0.65 % Negative unit clauses : 29
% 1.51/0.65 % Non-unit-clauses : 373
% 1.51/0.65 % Current number of unprocessed clauses: 7180
% 1.51/0.65 % ...number of literals in the above : 22191
% 1.51/0.65 % Current number of archived formulas : 0
% 1.51/0.65 % Current number of archived clauses : 7
% 1.51/0.65 % Clause-clause subsumption calls (NU) : 28116
% 1.51/0.65 % Rec. Clause-clause subsumption calls : 24794
% 1.51/0.65 % Non-unit clause-clause subsumptions : 747
% 1.51/0.65 % Unit Clause-clause subsumption calls : 583
% 1.51/0.65 % Rewrite failures with RHS unbound : 0
% 1.51/0.65 % BW rewrite match attempts : 500
% 1.51/0.65 % BW rewrite match successes : 2
% 1.51/0.65 % Condensation attempts : 0
% 1.51/0.65 % Condensation successes : 0
% 1.51/0.65 % Termbank termtop insertions : 137092
% 1.51/0.65 % Search garbage collected termcells : 11
% 1.51/0.65
% 1.51/0.65 % -------------------------------------------------
% 1.51/0.65 % User time : 0.205 s
% 1.51/0.65 % System time : 0.012 s
% 1.51/0.65 % Total time : 0.217 s
% 1.51/0.65 % Maximum resident set size: 3592 pages
% 1.51/0.65
% 1.51/0.65 % -------------------------------------------------
% 1.51/0.65 % User time : 0.923 s
% 1.51/0.65 % System time : 0.065 s
% 1.51/0.65 % Total time : 0.988 s
% 1.51/0.65 % Maximum resident set size: 4608 pages
% 1.51/0.65 % E exiting
%------------------------------------------------------------------------------