%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:14 PM UTC 2026
% Result : Unsatisfiable 0.15s 15.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 35 ( 35 unt; 0 nHn; 5 RR)
% Number of literals : 35 ( 34 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-4 aty)
% Number of variables : 61 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(prove_this,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).
cnf(c_0_9,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_10,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_11,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_12,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_13,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_15,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_17,plain,
ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_18,plain,
theorem(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
ifeq(theorem(or(not(or(not(X1),or(X2,X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_22,plain,
theorem(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_14]) ).
cnf(c_0_23,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_20]),c_0_14]) ).
cnf(c_0_24,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_25,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_14]) ).
cnf(c_0_26,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_24]),c_0_14]) ).
cnf(c_0_27,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_28,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_14]) ).
cnf(c_0_29,negated_conjecture,
theorem(not(and(p,not(p)))) != true,
c_0_27 ).
cnf(c_0_30,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_31,plain,
ifeq(theorem(X1),true,theorem(not(not(X1))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_28]),c_0_14]) ).
cnf(c_0_32,negated_conjecture,
theorem(not(not(or(not(p),not(not(p)))))) != true,
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
theorem(not(not(or(X1,not(X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_28]),c_0_14]) ).
cnf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL239-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/15.39 % Computer : n019.cluster.edu
% 0.12/15.39 % Model : x86_64 x86_64
% 0.12/15.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/15.39 % Memory : 8046.5625MB
% 0.12/15.39 % OS : Linux 6.8.0-71-generic
% 0.12/15.39 % CPULimit : 300
% 0.12/15.39 % WCLimit : 300
% 0.12/15.39 % DateTime : Mon Sep 21 00:14:22 UTC 2026
% 0.12/15.40 % CPUTime :
% 0.12/15.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/15.44 Running first-order theorem proving
% 0.15/15.44 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
% 0.15/15.47 % Version: 3.5.1
% 0.15/15.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/15.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/15.47 % Starting sh5l with 300s (1) cores
% 0.15/15.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1288689 completed with status 0
% 0.15/15.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/15.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/15.47 % No SInE strategy applied
% 0.15/15.47 % Search class: FUUPM-FFSF31-DFFFFFNN
% 0.15/15.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/15.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/15.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/15.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 254s (1) cores
% 0.15/15.47 % Starting new_bool_3 with 254s (1) cores
% 0.15/15.47 % Starting new_bool_1 with 254s (1) cores
% 0.15/15.47 % SubtermCWHack with pid 1288693 completed with status 0
% 0.15/15.47 % Result found by SubtermCWHack
% 0.15/15.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/15.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/15.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/15.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/15.47 % No SInE strategy applied
% 0.15/15.47 % Search class: FUUPM-FFSF31-DFFFFFNN
% 0.15/15.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/15.47 % Starting SubtermCWHack with 136s (1) cores
% 0.15/15.47 % Preprocessing time : 0.001 s
% 0.15/15.47
% 0.15/15.47 % Proof found!
% 0.15/15.47 % SZS status Unsatisfiable
% 0.15/15.47 % SZS output start CNFRefutation
% See solution above
% 0.15/15.47 % Parsed axioms : 11
% 0.15/15.47 % Removed by relevancy pruning/SinE : 0
% 0.15/15.47 % Initial clauses : 11
% 0.15/15.47 % Removed in clause preprocessing : 2
% 0.15/15.47 % Initial clauses in saturation : 9
% 0.15/15.47 % Processed clauses : 92
% 0.15/15.47 % ...of these trivial : 8
% 0.15/15.47 % ...subsumed : 0
% 0.15/15.47 % ...remaining for further processing : 84
% 0.15/15.47 % Other redundant clauses eliminated : 0
% 0.15/15.47 % Clauses deleted for lack of memory : 0
% 0.15/15.47 % Backward-subsumed : 0
% 0.15/15.47 % Backward-rewritten : 1
% 0.15/15.47 % Generated clauses : 950
% 0.15/15.47 % ...of the previous two non-redundant : 316
% 0.15/15.47 % ...aggressively subsumed : 0
% 0.15/15.47 % Contextual simplify-reflections : 0
% 0.15/15.47 % Paramodulations : 950
% 0.15/15.47 % Factorizations : 0
% 0.15/15.47 % NegExts : 0
% 0.15/15.47 % Equation resolutions : 0
% 0.15/15.47 % Disequality decompositions : 0
% 0.15/15.47 % Total rewrite steps : 1200
% 0.15/15.47 % ...of those cached : 635
% 0.15/15.47 % Propositional unsat checks : 0
% 0.15/15.47 % Propositional check models : 0
% 0.15/15.47 % Propositional check unsatisfiable : 0
% 0.15/15.47 % Propositional clauses : 0
% 0.15/15.47 % Propositional clauses after purity: 0
% 0.15/15.47 % Propositional unsat core size : 0
% 0.15/15.47 % Propositional preprocessing time : 0.000
% 0.15/15.47 % Propositional encoding time : 0.000
% 0.15/15.47 % Propositional solver time : 0.000
% 0.15/15.47 % Success case prop preproc time : 0.000
% 0.15/15.47 % Success case prop encoding time : 0.000
% 0.15/15.47 % Success case prop solver time : 0.000
% 0.15/15.47 % Current number of processed clauses : 83
% 0.15/15.47 % Positive orientable unit clauses : 83
% 0.15/15.47 % Positive unorientable unit clauses: 0
% 0.15/15.47 % Negative unit clauses : 0
% 0.15/15.47 % Non-unit-clauses : 0
% 0.15/15.47 % Current number of unprocessed clauses: 233
% 0.15/15.47 % ...number of literals in the above : 233
% 0.15/15.47 % Current number of archived formulas : 0
% 0.15/15.47 % Current number of archived clauses : 3
% 0.15/15.47 % Clause-clause subsumption calls (NU) : 0
% 0.15/15.47 % Rec. Clause-clause subsumption calls : 0
% 0.15/15.47 % Non-unit clause-clause subsumptions : 0
% 0.15/15.47 % Unit Clause-clause subsumption calls : 0
% 0.15/15.47 % Rewrite failures with RHS unbound : 0
% 0.15/15.47 % BW rewrite match attempts : 675
% 0.15/15.47 % BW rewrite match successes : 1
% 0.15/15.47 % Condensation attempts : 0
% 0.15/15.47 % Condensation successes : 0
% 0.15/15.47 % Termbank termtop insertions : 14571
% 0.15/15.47 % Search garbage collected termcells : 2
% 0.15/15.47
% 0.15/15.47 % -------------------------------------------------
% 0.15/15.47 % User time : 0.005 s
% 0.15/15.47 % System time : 0.007 s
% 0.15/15.47 % Total time : 0.012 s
% 0.15/15.47 % Maximum resident set size: 3636 pages
% 0.15/15.47
% 0.15/15.47 % -------------------------------------------------
% 0.15/15.47 % User time : 0.033 s
% 0.15/15.47 % System time : 0.021 s
% 0.15/15.47 % Total time : 0.054 s
% 0.15/15.47 % Maximum resident set size: 4608 pages
% 0.15/15.47 % E exiting
%------------------------------------------------------------------------------