%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL296-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:19:04 PM UTC 2026
% Result : Unsatisfiable 0.25s 0.66s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 52 ( 26 unt; 0 nHn; 26 RR)
% Number of literals : 85 ( 8 equ; 39 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 : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 93 ( 10 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(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',rule_1) ).
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_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
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(prove_this,negated_conjecture,
~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(c_0_10,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_11,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_10 ).
cnf(c_0_13,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_11 ).
cnf(c_0_14,plain,
( ~ axiom(implies(X2,X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_18,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_21,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_23,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_24,plain,
( ~ theorem(implies(X1,X3))
| theorem(implies(X1,or(X2,X3))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
( ~ axiom(or(X2,not(X1)))
| theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,plain,
( ~ theorem(X3)
| ~ theorem(implies(X3,X2))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_24]) ).
cnf(c_0_27,plain,
( ~ axiom(implies(X2,not(X1)))
| theorem(implies(X1,not(X2))) ),
inference(spm,[status(thm)],[c_0_25,c_0_22]) ).
cnf(c_0_28,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_29,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_30,plain,
( ~ axiom(implies(X3,X2))
| ~ theorem(X3)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_13]) ).
cnf(c_0_31,negated_conjecture,
~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_32,plain,
( ~ axiom(implies(X1,not(X2)))
| ~ theorem(X2)
| theorem(not(X1)) ),
inference(spm,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_33,plain,
axiom(implies(implies(X1,not(X1)),not(X1))),
inference(spm,[status(thm)],[c_0_28,c_0_22]) ).
cnf(c_0_34,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_35,plain,
( ~ theorem(or(X3,X2))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_30,c_0_17]) ).
cnf(c_0_36,negated_conjecture,
~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
c_0_31 ).
cnf(c_0_37,plain,
( ~ theorem(X1)
| theorem(and(X1,X1)) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_38,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_39,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_28]) ).
cnf(c_0_40,plain,
( ~ theorem(or(X3,X1))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_41,negated_conjecture,
~ theorem(equivalent(implies(p,not(q)),implies(p,not(q)))),
inference(rw,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_42,plain,
( ~ theorem(implies(X1,X1))
| theorem(equivalent(X1,X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( ~ theorem(or(X2,or(X1,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
( ~ axiom(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_45,plain,
implies(implies(X1,not(X2)),X3) = or(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(implies(implies(p,not(q)),implies(p,not(q)))),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,plain,
( ~ axiom(or(X1,or(X2,X2)))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
axiom(or(and(X1,X2),or(X3,implies(X1,not(X2))))),
inference(spm,[status(thm)],[c_0_16,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ theorem(or(and(p,q),implies(p,not(q)))),
inference(rw,[status(thm)],[c_0_46,c_0_45]) ).
cnf(c_0_50,plain,
theorem(or(and(X1,X2),implies(X1,not(X2)))),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL296-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.50 % Computer : n008.cluster.edu
% 0.20/0.50 % Model : x86_64 x86_64
% 0.20/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.50 % Memory : 8046.5625MB
% 0.20/0.50 % OS : Linux 6.8.0-71-generic
% 0.20/0.50 % CPULimit : 300
% 0.20/0.50 % WCLimit : 300
% 0.20/0.51 % DateTime : Mon Sep 21 00:20:10 UTC 2026
% 0.20/0.51 % CPUTime :
% 0.20/0.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.59 Running first-order theorem proving
% 0.25/0.59 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.25/0.66 % Version: 3.5.1
% 0.25/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.66 % Starting sh5l with 300s (1) cores
% 0.25/0.66 % new_bool_3 with pid 3951881 completed with status 0
% 0.25/0.66 % Result found by new_bool_3
% 0.25/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.66 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.25/0.66 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.66 % SubtermCWHack with pid 3951884 completed with status 0
% 0.25/0.66 % Result found by SubtermCWHack
% 0.25/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.25/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.25/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.66 % Search class: FHUSM-FFSF21-MFFFFFNN
% 0.25/0.66 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.66 % Starting SubtermCWHack with 28s (1) cores
% 0.25/0.66 % Preprocessing time : 0.001 s
% 0.25/0.66
% 0.25/0.66 % Proof found!
% 0.25/0.66 % SZS status Unsatisfiable
% 0.25/0.66 % SZS output start CNFRefutation
% See solution above
% 0.25/0.67 % Parsed axioms : 11
% 0.25/0.67 % Removed by relevancy pruning/SinE : 0
% 0.25/0.67 % Initial clauses : 11
% 0.25/0.67 % Removed in clause preprocessing : 0
% 0.25/0.67 % Initial clauses in saturation : 11
% 0.25/0.67 % Processed clauses : 883
% 0.25/0.67 % ...of these trivial : 12
% 0.25/0.67 % ...subsumed : 618
% 0.25/0.67 % ...remaining for further processing : 253
% 0.25/0.67 % Other redundant clauses eliminated : 0
% 0.25/0.67 % Clauses deleted for lack of memory : 0
% 0.25/0.67 % Backward-subsumed : 2
% 0.25/0.67 % Backward-rewritten : 4
% 0.25/0.67 % Generated clauses : 2186
% 0.25/0.67 % ...of the previous two non-redundant : 2007
% 0.25/0.67 % ...aggressively subsumed : 0
% 0.25/0.67 % Contextual simplify-reflections : 0
% 0.25/0.67 % Paramodulations : 2186
% 0.25/0.67 % Factorizations : 0
% 0.25/0.67 % NegExts : 0
% 0.25/0.67 % Equation resolutions : 0
% 0.25/0.67 % Disequality decompositions : 0
% 0.25/0.67 % Total rewrite steps : 772
% 0.25/0.67 % ...of those cached : 533
% 0.25/0.67 % Propositional unsat checks : 0
% 0.25/0.67 % Propositional check models : 0
% 0.25/0.67 % Propositional check unsatisfiable : 0
% 0.25/0.67 % Propositional clauses : 0
% 0.25/0.67 % Propositional clauses after purity: 0
% 0.25/0.67 % Propositional unsat core size : 0
% 0.25/0.67 % Propositional preprocessing time : 0.000
% 0.25/0.67 % Propositional encoding time : 0.000
% 0.25/0.67 % Propositional solver time : 0.000
% 0.25/0.67 % Success case prop preproc time : 0.000
% 0.25/0.67 % Success case prop encoding time : 0.000
% 0.25/0.67 % Success case prop solver time : 0.000
% 0.25/0.67 % Current number of processed clauses : 247
% 0.25/0.67 % Positive orientable unit clauses : 48
% 0.25/0.67 % Positive unorientable unit clauses: 0
% 0.25/0.67 % Negative unit clauses : 17
% 0.25/0.67 % Non-unit-clauses : 182
% 0.25/0.67 % Current number of unprocessed clauses: 1128
% 0.25/0.67 % ...number of literals in the above : 2433
% 0.25/0.67 % Current number of archived formulas : 0
% 0.25/0.67 % Current number of archived clauses : 6
% 0.25/0.67 % Clause-clause subsumption calls (NU) : 6764
% 0.25/0.67 % Rec. Clause-clause subsumption calls : 6619
% 0.25/0.67 % Non-unit clause-clause subsumptions : 599
% 0.25/0.67 % Unit Clause-clause subsumption calls : 49
% 0.25/0.67 % Rewrite failures with RHS unbound : 0
% 0.25/0.67 % BW rewrite match attempts : 42
% 0.25/0.67 % BW rewrite match successes : 4
% 0.25/0.67 % Condensation attempts : 0
% 0.25/0.67 % Condensation successes : 0
% 0.25/0.67 % Termbank termtop insertions : 26761
% 0.25/0.67 % Search garbage collected termcells : 11
% 0.25/0.67
% 0.25/0.67 % -------------------------------------------------
% 0.25/0.67 % User time : 0.044 s
% 0.25/0.67 % System time : 0.003 s
% 0.25/0.67 % Total time : 0.046 s
% 0.25/0.67 % Maximum resident set size: 3644 pages
% 0.25/0.67
% 0.25/0.67 % -------------------------------------------------
% 0.25/0.67 % User time : 0.045 s
% 0.25/0.67 % System time : 0.007 s
% 0.25/0.67 % Total time : 0.052 s
% 0.25/0.67 % Maximum resident set size: 4864 pages
% 0.25/0.67 % E exiting
%------------------------------------------------------------------------------