%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL271-3 : TPTP v9.3.1. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:19 PM UTC 2026
% Result : Unsatisfiable 0.07s 0.37s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 11
% Syntax : Number of clauses : 58 ( 39 unt; 0 nHn; 20 RR)
% Number of literals : 83 ( 7 equ; 30 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-2 aty)
% Number of variables : 103 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).
cnf(implies_definition,axiom,
implies(X1,X2) = or(not(X1),X2),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).
cnf(rule_1,axiom,
( ~ axiom(X1)
| theorem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_4) ).
cnf(axiom_1_3,axiom,
axiom(implies(X1,or(X2,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_3) ).
cnf(axiom_1_5,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_5) ).
cnf(axiom_1_2,axiom,
axiom(implies(or(X1,X1),X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_2) ).
cnf(axiom_1_6,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).
cnf(prove_this,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(equivalent_defn,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).
cnf(and_defn,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).
cnf(c_0_11,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_2]) ).
cnf(c_0_12,plain,
( ~ theorem(X2)
| ~ theorem(implies(X2,X1))
| theorem(X1) ),
c_0_11 ).
cnf(c_0_13,axiom,
implies(X1,X2) = or(not(X1),X2),
implies_definition ).
cnf(c_0_14,plain,
( ~ axiom(X1)
| theorem(X1) ),
inference(fof_simplification,[status(thm)],[rule_1]) ).
cnf(c_0_15,plain,
( ~ theorem(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( ~ axiom(X1)
| theorem(X1) ),
c_0_14 ).
cnf(c_0_17,axiom,
axiom(implies(or(X1,X2),or(X2,X1))),
axiom_1_4 ).
cnf(c_0_18,plain,
( ~ axiom(or(not(X2),X1))
| ~ theorem(X2)
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))),
inference(rw,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_20,plain,
( ~ theorem(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
axiom(implies(X1,or(X2,X1))),
axiom_1_3 ).
cnf(c_0_22,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))),
axiom_1_5 ).
cnf(c_0_23,plain,
( ~ axiom(or(X2,X1))
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_24,plain,
axiom(or(not(X1),or(X2,X1))),
inference(rw,[status(thm)],[c_0_21,c_0_13]) ).
cnf(c_0_25,axiom,
axiom(implies(or(X1,X1),X1)),
axiom_1_2 ).
cnf(c_0_26,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))),
inference(rw,[status(thm)],[c_0_22,c_0_13]) ).
cnf(c_0_27,plain,
theorem(or(or(X1,X2),not(X2))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
axiom(or(not(or(X1,X1)),X1)),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_29,plain,
( ~ theorem(or(X2,or(X1,X3)))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_30,plain,
theorem(or(not(X1),or(X2,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,plain,
( ~ theorem(or(X1,X1))
| theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_32,plain,
theorem(or(X1,or(not(X2),X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))),
axiom_1_6 ).
cnf(c_0_34,plain,
theorem(or(not(X1),X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,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_33,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_36,plain,
theorem(or(X1,or(not(or(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_29,c_0_34]) ).
cnf(c_0_37,plain,
( ~ theorem(or(not(X2),X3))
| theorem(or(not(or(X1,X2)),or(X1,X3))) ),
inference(spm,[status(thm)],[c_0_18,c_0_35]) ).
cnf(c_0_38,plain,
theorem(or(X1,not(X1))),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_39,plain,
( ~ theorem(X2)
| theorem(or(X1,X2)) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_40,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_41,axiom,
equivalent(X1,X2) = and(implies(X1,X2),implies(X2,X1)),
equivalent_defn ).
cnf(c_0_42,axiom,
and(X1,X2) = not(or(not(X1),not(X2))),
and_defn ).
cnf(c_0_43,plain,
( ~ theorem(X1)
| theorem(or(not(or(not(X1),X2)),X2)) ),
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_44,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
( ~ theorem(or(X1,X3))
| theorem(or(X1,or(X2,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_39]) ).
cnf(c_0_46,negated_conjecture,
~ theorem(equivalent(p,and(p,p))),
c_0_40 ).
cnf(c_0_47,plain,
equivalent(X1,X2) = not(or(not(or(not(X1),X2)),not(or(not(X2),X1)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_13]),c_0_13]),c_0_42]) ).
cnf(c_0_48,plain,
( ~ theorem(X2)
| theorem(or(X1,not(or(not(X2),X1)))) ),
inference(spm,[status(thm)],[c_0_20,c_0_43]) ).
cnf(c_0_49,plain,
( ~ theorem(or(X1,X2))
| theorem(or(X1,not(not(X2)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_44]) ).
cnf(c_0_50,plain,
theorem(or(X1,or(X2,not(X1)))),
inference(spm,[status(thm)],[c_0_45,c_0_38]) ).
cnf(c_0_51,negated_conjecture,
~ theorem(not(or(not(or(not(p),not(or(not(p),not(p))))),not(or(not(not(or(not(p),not(p)))),p))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_42]),c_0_47]) ).
cnf(c_0_52,plain,
( ~ theorem(X1)
| ~ theorem(X2)
| theorem(not(or(not(X1),not(X2)))) ),
inference(spm,[status(thm)],[c_0_15,c_0_48]) ).
cnf(c_0_53,plain,
theorem(or(X1,not(or(X1,X1)))),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_54,plain,
theorem(or(X1,not(not(or(X2,not(X1)))))),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,negated_conjecture,
~ theorem(or(not(not(or(not(p),not(p)))),p)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,plain,
theorem(or(not(not(or(X1,not(X2)))),X2)),
inference(spm,[status(thm)],[c_0_20,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : LCL271-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 21 00:17:21 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.37 % Version: 3.5.1
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.37 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.37 % Starting sh5l with 300s (1) cores
% 0.07/0.37 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1212418 completed with status 0
% 0.07/0.37 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.37 % No SInE strategy applied
% 0.07/0.37 % Search class: FHUNM-FFSF21-DFFFFFNN
% 0.07/0.37 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.37 % Starting SubtermCWHack with 151s (1) cores
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.07/0.37 % Starting new_bool_3 with 329s (1) cores
% 0.07/0.37 % Starting new_bool_1 with 291s (1) cores
% 0.07/0.37 % new_bool_3 with pid 1212428 completed with status 0
% 0.07/0.37 % Result found by new_bool_3
% 0.07/0.37 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.07/0.37 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.07/0.37 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.07/0.37 % No SInE strategy applied
% 0.07/0.37 % Search class: FHUNM-FFSF21-DFFFFFNN
% 0.07/0.37 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.07/0.37 % Starting SubtermCWHack with 151s (1) cores
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 395s (1) cores
% 0.07/0.37 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 334s (1) cores
% 0.07/0.37 % Starting new_bool_3 with 329s (1) cores
% 0.07/0.37 % Preprocessing time : 0.001 s
% 0.07/0.37 % Presaturation interreduction done
% 0.07/0.37
% 0.07/0.37 % Proof found!
% 0.07/0.37 % SZS status Unsatisfiable
% 0.07/0.37 % SZS output start CNFRefutation
% See solution above
% 0.07/0.37 % Parsed axioms : 11
% 0.07/0.37 % Removed by relevancy pruning/SinE : 0
% 0.07/0.37 % Initial clauses : 11
% 0.07/0.37 % Removed in clause preprocessing : 3
% 0.07/0.37 % Initial clauses in saturation : 8
% 0.07/0.37 % Processed clauses : 810
% 0.07/0.37 % ...of these trivial : 20
% 0.07/0.37 % ...subsumed : 442
% 0.07/0.37 % ...remaining for further processing : 348
% 0.07/0.37 % Other redundant clauses eliminated : 0
% 0.07/0.37 % Clauses deleted for lack of memory : 0
% 0.07/0.37 % Backward-subsumed : 4
% 0.07/0.37 % Backward-rewritten : 1
% 0.07/0.37 % Generated clauses : 2973
% 0.07/0.37 % ...of the previous two non-redundant : 2669
% 0.07/0.37 % ...aggressively subsumed : 0
% 0.07/0.37 % Contextual simplify-reflections : 0
% 0.07/0.37 % Paramodulations : 2973
% 0.07/0.37 % Factorizations : 0
% 0.07/0.37 % NegExts : 0
% 0.07/0.37 % Equation resolutions : 0
% 0.07/0.37 % Disequality decompositions : 0
% 0.07/0.37 % Total rewrite steps : 294
% 0.07/0.37 % ...of those cached : 183
% 0.07/0.37 % Propositional unsat checks : 0
% 0.07/0.37 % Propositional check models : 0
% 0.07/0.37 % Propositional check unsatisfiable : 0
% 0.07/0.37 % Propositional clauses : 0
% 0.07/0.37 % Propositional clauses after purity: 0
% 0.07/0.37 % Propositional unsat core size : 0
% 0.07/0.37 % Propositional preprocessing time : 0.000
% 0.07/0.37 % Propositional encoding time : 0.000
% 0.07/0.37 % Propositional solver time : 0.000
% 0.07/0.37 % Success case prop preproc time : 0.000
% 0.07/0.37 % Success case prop encoding time : 0.000
% 0.07/0.37 % Success case prop solver time : 0.000
% 0.07/0.37 % Current number of processed clauses : 335
% 0.07/0.37 % Positive orientable unit clauses : 110
% 0.07/0.37 % Positive unorientable unit clauses: 0
% 0.07/0.37 % Negative unit clauses : 11
% 0.07/0.37 % Non-unit-clauses : 214
% 0.07/0.37 % Current number of unprocessed clauses: 1875
% 0.07/0.37 % ...number of literals in the above : 2709
% 0.07/0.37 % Current number of archived formulas : 0
% 0.07/0.37 % Current number of archived clauses : 16
% 0.07/0.37 % Clause-clause subsumption calls (NU) : 5424
% 0.07/0.37 % Rec. Clause-clause subsumption calls : 5385
% 0.07/0.37 % Non-unit clause-clause subsumptions : 442
% 0.07/0.37 % Unit Clause-clause subsumption calls : 225
% 0.07/0.37 % Rewrite failures with RHS unbound : 0
% 0.07/0.37 % BW rewrite match attempts : 2364
% 0.07/0.37 % BW rewrite match successes : 1
% 0.07/0.37 % Condensation attempts : 0
% 0.07/0.37 % Condensation successes : 0
% 0.07/0.37 % Termbank termtop insertions : 36417
% 0.07/0.37 % Search garbage collected termcells : 11
% 0.07/0.37
% 0.07/0.37 % -------------------------------------------------
% 0.07/0.37 % User time : 0.030 s
% 0.07/0.37 % System time : 0.002 s
% 0.07/0.37 % Total time : 0.032 s
% 0.07/0.37 % Maximum resident set size: 3644 pages
% 0.07/0.37
% 0.07/0.37 % -------------------------------------------------
% 0.07/0.37 % User time : 0.152 s
% 0.07/0.37 % System time : 0.011 s
% 0.07/0.37 % Total time : 0.163 s
% 0.07/0.37 % Maximum resident set size: 4608 pages
% 0.07/0.37 % E exiting
%------------------------------------------------------------------------------