%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL265-10 : TPTP v9.3.1. Released v7.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:18 PM UTC 2026
% Result : Unsatisfiable 23.98s 4.06s
% Output : CNFRefutation 23.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 55 ( 55 unt; 0 nHn; 4 RR)
% Number of literals : 55 ( 54 equ; 3 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 : 10 ( 10 usr; 2 con; 0-4 aty)
% Number of variables : 108 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(rule_2,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',and_defn) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equivalent_defn) ).
cnf(prove_this,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_11,axiom,
axiom(implies(X1,or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_12,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_13,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_14,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_17,plain,
axiom(implies(X1,implies(X2,X1))) = true,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
theorem(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_19,plain,
theorem(implies(or(X1,X2),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_15]) ).
cnf(c_0_20,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_21,plain,
theorem(implies(X1,implies(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_15]) ).
cnf(c_0_22,plain,
theorem(implies(implies(X1,or(X2,X3)),or(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_12]) ).
cnf(c_0_23,plain,
theorem(implies(implies(X1,X2),or(X2,not(X1)))) = true,
inference(spm,[status(thm)],[c_0_19,c_0_12]) ).
cnf(c_0_24,plain,
ifeq(theorem(implies(implies(X1,implies(X2,X1)),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_15]) ).
cnf(c_0_25,plain,
theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_12]),c_0_12]) ).
cnf(c_0_26,plain,
ifeq(theorem(implies(implies(implies(X1,X2),or(X2,not(X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_15]) ).
cnf(c_0_27,plain,
theorem(implies(X1,implies(X2,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]) ).
cnf(c_0_28,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_29,plain,
ifeq(theorem(implies(X1,X2)),true,theorem(or(X2,not(X1))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_23]),c_0_15]) ).
cnf(c_0_30,plain,
theorem(implies(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]) ).
cnf(c_0_31,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_32,plain,
theorem(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_28]),c_0_15]) ).
cnf(c_0_33,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_15]) ).
cnf(c_0_34,plain,
not(implies(X1,not(X2))) = and(X1,X2),
inference(rw,[status(thm)],[c_0_31,c_0_12]) ).
cnf(c_0_35,plain,
ifeq(theorem(implies(X1,X2)),true,theorem(implies(or(X3,X1),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_32]),c_0_15]) ).
cnf(c_0_36,plain,
theorem(implies(X1,not(not(X1)))) = true,
inference(spm,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_37,plain,
theorem(or(X1,implies(implies(X2,X1),not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_15]) ).
cnf(c_0_38,plain,
implies(implies(X1,not(X2)),X3) = or(and(X1,X2),X3),
inference(spm,[status(thm)],[c_0_12,c_0_34]) ).
cnf(c_0_39,plain,
ifeq(theorem(implies(or(X1,not(X1)),X2)),true,theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_33]),c_0_15]) ).
cnf(c_0_40,plain,
theorem(implies(or(X1,X2),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_15]) ).
cnf(c_0_41,plain,
theorem(implies(X1,or(and(X2,X1),not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_12]) ).
cnf(c_0_42,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_15]) ).
cnf(c_0_43,plain,
theorem(or(X1,not(not(not(X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_15]) ).
cnf(c_0_44,plain,
ifeq(theorem(X1),true,theorem(or(and(X2,X1),not(X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_41]),c_0_15]) ).
cnf(c_0_45,plain,
theorem(implies(not(not(X1)),X1)) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_12]),c_0_15]) ).
cnf(c_0_46,plain,
theorem(or(and(X1,implies(not(not(X2)),X2)),not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_15]) ).
cnf(c_0_47,plain,
theorem(implies(X1,and(X1,implies(not(not(X2)),X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_46]),c_0_12]),c_0_15]) ).
cnf(c_0_48,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_49,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_50,plain,
ifeq(theorem(or(and(X1,X2),X3)),true,ifeq(theorem(implies(X1,not(X2))),true,theorem(X3),true),true) = true,
inference(spm,[status(thm)],[c_0_20,c_0_38]) ).
cnf(c_0_51,plain,
theorem(or(and(X1,not(X1)),equivalent(X1,not(not(X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_38]) ).
cnf(c_0_52,negated_conjecture,
theorem(equivalent(p,not(not(p)))) != true,
c_0_49 ).
cnf(c_0_53,plain,
theorem(equivalent(X1,not(not(X1)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_36]),c_0_15]),c_0_15]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL265-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n008.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Mon Sep 21 00:18:00 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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
% 23.98/4.06 % Version: 3.5.1
% 23.98/4.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 23.98/4.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.98/4.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 23.98/4.06 % Starting new_bool_3 with 300s (1) cores
% 23.98/4.06 % Starting new_bool_1 with 300s (1) cores
% 23.98/4.06 % Starting sh5l with 300s (1) cores
% 23.98/4.06 % new_bool_3 with pid 3949282 completed with status 0
% 23.98/4.06 % Result found by new_bool_3
% 23.98/4.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 23.98/4.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.98/4.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 23.98/4.06 % Starting new_bool_3 with 300s (1) cores
% 23.98/4.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 23.98/4.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.98/4.06 % Search class: FUUPM-FFSF31-MFFFFFNN
% 23.98/4.06 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.98/4.06 % Starting SubtermCWHack with 31s (1) cores
% 23.98/4.06 % SubtermCWHack with pid 3949288 completed with status 0
% 23.98/4.06 % Result found by SubtermCWHack
% 23.98/4.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 23.98/4.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 23.98/4.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 23.98/4.06 % Starting new_bool_3 with 300s (1) cores
% 23.98/4.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 23.98/4.06 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 23.98/4.06 % Search class: FUUPM-FFSF31-MFFFFFNN
% 23.98/4.06 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 23.98/4.06 % Starting SubtermCWHack with 31s (1) cores
% 23.98/4.06 % Preprocessing time : 0.001 s
% 23.98/4.06
% 23.98/4.06 % Proof found!
% 23.98/4.06 % SZS status Unsatisfiable
% 23.98/4.06 % SZS output start CNFRefutation
% See solution above
% 23.98/4.06 % Parsed axioms : 12
% 23.98/4.06 % Removed by relevancy pruning/SinE : 0
% 23.98/4.06 % Initial clauses : 12
% 23.98/4.06 % Removed in clause preprocessing : 0
% 23.98/4.06 % Initial clauses in saturation : 12
% 23.98/4.06 % Processed clauses : 4914
% 23.98/4.06 % ...of these trivial : 1780
% 23.98/4.06 % ...subsumed : 0
% 23.98/4.06 % ...remaining for further processing : 3134
% 23.98/4.06 % Other redundant clauses eliminated : 0
% 23.98/4.06 % Clauses deleted for lack of memory : 0
% 23.98/4.06 % Backward-subsumed : 0
% 23.98/4.06 % Backward-rewritten : 60
% 23.98/4.06 % Generated clauses : 439589
% 23.98/4.06 % ...of the previous two non-redundant : 115972
% 23.98/4.06 % ...aggressively subsumed : 0
% 23.98/4.06 % Contextual simplify-reflections : 0
% 23.98/4.06 % Paramodulations : 439589
% 23.98/4.06 % Factorizations : 0
% 23.98/4.06 % NegExts : 0
% 23.98/4.06 % Equation resolutions : 0
% 23.98/4.06 % Disequality decompositions : 0
% 23.98/4.06 % Total rewrite steps : 521227
% 23.98/4.06 % ...of those cached : 191303
% 23.98/4.06 % Propositional unsat checks : 0
% 23.98/4.06 % Propositional check models : 0
% 23.98/4.06 % Propositional check unsatisfiable : 0
% 23.98/4.06 % Propositional clauses : 0
% 23.98/4.06 % Propositional clauses after purity: 0
% 23.98/4.06 % Propositional unsat core size : 0
% 23.98/4.06 % Propositional preprocessing time : 0.000
% 23.98/4.06 % Propositional encoding time : 0.000
% 23.98/4.06 % Propositional solver time : 0.000
% 23.98/4.06 % Success case prop preproc time : 0.000
% 23.98/4.06 % Success case prop encoding time : 0.000
% 23.98/4.06 % Success case prop solver time : 0.000
% 23.98/4.06 % Current number of processed clauses : 3074
% 23.98/4.06 % Positive orientable unit clauses : 3074
% 23.98/4.06 % Positive unorientable unit clauses: 0
% 23.98/4.06 % Negative unit clauses : 0
% 23.98/4.06 % Non-unit-clauses : 0
% 23.98/4.06 % Current number of unprocessed clauses: 111010
% 23.98/4.06 % ...number of literals in the above : 111010
% 23.98/4.06 % Current number of archived formulas : 0
% 23.98/4.06 % Current number of archived clauses : 60
% 23.98/4.06 % Clause-clause subsumption calls (NU) : 0
% 23.98/4.06 % Rec. Clause-clause subsumption calls : 0
% 23.98/4.06 % Non-unit clause-clause subsumptions : 0
% 23.98/4.06 % Unit Clause-clause subsumption calls : 0
% 23.98/4.06 % Rewrite failures with RHS unbound : 0
% 23.98/4.06 % BW rewrite match attempts : 250463
% 23.98/4.06 % BW rewrite match successes : 58
% 23.98/4.06 % Condensation attempts : 0
% 23.98/4.06 % Condensation successes : 0
% 23.98/4.06 % Termbank termtop insertions : 7298745
% 23.98/4.06 % Search garbage collected termcells : 2
% 23.98/4.06
% 23.98/4.06 % -------------------------------------------------
% 23.98/4.06 % User time : 3.372 s
% 23.98/4.06 % System time : 0.156 s
% 23.98/4.06 % Total time : 3.528 s
% 23.98/4.06 % Maximum resident set size: 3584 pages
% 23.98/4.06
% 23.98/4.06 % -------------------------------------------------
% 23.98/4.06 % User time : 3.374 s
% 23.98/4.06 % System time : 0.160 s
% 23.98/4.06 % Total time : 3.534 s
% 23.98/4.06 % Maximum resident set size: 4608 pages
% 23.98/4.06 % E exiting
%------------------------------------------------------------------------------