%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL211-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:18:49 PM UTC 2026
% Result : Unsatisfiable 5.27s 1.18s
% Output : CNFRefutation 5.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 86 ( 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(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(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).
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(prove_this,negated_conjecture,
theorem(implies(not(q),implies(or(p,q),p))) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_12,axiom,
ifeq(theorem(implies(X1,X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_13,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_14,plain,
axiom(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_16,axiom,
axiom(implies(or(X1,or(X2,X3)),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_17,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_18,plain,
ifeq(theorem(or(not(X1),X2)),true,ifeq(theorem(X1),true,theorem(X2),true),true) = true,
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_19,plain,
theorem(or(not(X1),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_21,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17]),c_0_15]) ).
cnf(c_0_22,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_23,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_18,c_0_19]),c_0_15]) ).
cnf(c_0_24,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_13,c_0_20]),c_0_15]) ).
cnf(c_0_25,plain,
ifeq(theorem(or(not(or(not(or(X1,X2)),or(X2,X1))),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_15]) ).
cnf(c_0_26,plain,
axiom(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_27,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).
cnf(c_0_28,plain,
ifeq(theorem(or(X1,X2)),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_15]) ).
cnf(c_0_29,plain,
theorem(or(X1,or(not(or(X2,X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_15]) ).
cnf(c_0_30,plain,
theorem(or(not(or(not(X1),X2)),or(not(or(X3,X1)),or(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_26]),c_0_15]) ).
cnf(c_0_31,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_27]),c_0_15]) ).
cnf(c_0_32,plain,
theorem(or(or(not(or(X1,X2)),X1),X2)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_15]) ).
cnf(c_0_33,plain,
ifeq(theorem(or(not(X1),X2)),true,theorem(or(not(or(X3,X1)),or(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_30]),c_0_15]) ).
cnf(c_0_34,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_31]),c_0_15]) ).
cnf(c_0_35,negated_conjecture,
theorem(implies(not(q),implies(or(p,q),p))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,plain,
ifeq(theorem(or(not(or(or(not(or(X1,X2)),X1),X2)),X3)),true,theorem(X3),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_32]),c_0_15]) ).
cnf(c_0_37,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15]) ).
cnf(c_0_38,negated_conjecture,
theorem(implies(not(q),implies(or(p,q),p))) != true,
c_0_35 ).
cnf(c_0_39,plain,
theorem(or(or(not(or(X1,X2)),X1),not(not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_15]) ).
cnf(c_0_40,negated_conjecture,
theorem(or(not(not(q)),or(not(or(p,q)),p))) != true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_10]),c_0_10]) ).
cnf(c_0_41,plain,
theorem(or(not(not(X1)),or(not(or(X2,X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_39]),c_0_15]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL211-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n009.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:11:43 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 5.27/1.18 % Version: 3.5.1
% 5.27/1.18 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.27/1.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.27/1.18 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.27/1.18 % Starting new_bool_3 with 300s (1) cores
% 5.27/1.18 % Starting new_bool_1 with 300s (1) cores
% 5.27/1.18 % Starting sh5l with 300s (1) cores
% 5.27/1.18 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 429809 completed with status 0
% 5.27/1.18 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 5.27/1.18 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.27/1.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.27/1.18 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.27/1.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.27/1.18 % No SInE strategy applied
% 5.27/1.18 % Search class: FUUPM-FFSF31-MFFFFFNN
% 5.27/1.18 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.27/1.18 % Starting SubtermCWHack with 151s (1) cores
% 5.27/1.18 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 5.27/1.18 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 5.27/1.18 % Starting new_bool_3 with 251s (1) cores
% 5.27/1.18 % Starting new_bool_1 with 251s (1) cores
% 5.27/1.18 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 429816 completed with status 0
% 5.27/1.18 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 5.27/1.18 % Preprocessing class: FSSSSMSSSSSNFFN.
% 5.27/1.18 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.27/1.18 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 5.27/1.18 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 5.27/1.18 % No SInE strategy applied
% 5.27/1.18 % Search class: FUUPM-FFSF31-MFFFFFNN
% 5.27/1.18 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.27/1.18 % Starting SubtermCWHack with 151s (1) cores
% 5.27/1.18 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 5.27/1.18 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 5.27/1.18 % Preprocessing time : 0.001 s
% 5.27/1.18
% 5.27/1.18 % Proof found!
% 5.27/1.18 % SZS status Unsatisfiable
% 5.27/1.18 % SZS output start CNFRefutation
% See solution above
% 5.27/1.18 % Parsed axioms : 10
% 5.27/1.18 % Removed by relevancy pruning/SinE : 0
% 5.27/1.18 % Initial clauses : 10
% 5.27/1.18 % Removed in clause preprocessing : 1
% 5.27/1.18 % Initial clauses in saturation : 9
% 5.27/1.18 % Processed clauses : 799
% 5.27/1.18 % ...of these trivial : 75
% 5.27/1.18 % ...subsumed : 0
% 5.27/1.18 % ...remaining for further processing : 724
% 5.27/1.18 % Other redundant clauses eliminated : 0
% 5.27/1.18 % Clauses deleted for lack of memory : 0
% 5.27/1.18 % Backward-subsumed : 0
% 5.27/1.18 % Backward-rewritten : 1
% 5.27/1.18 % Generated clauses : 54891
% 5.27/1.18 % ...of the previous two non-redundant : 9086
% 5.27/1.18 % ...aggressively subsumed : 0
% 5.27/1.18 % Contextual simplify-reflections : 0
% 5.27/1.18 % Paramodulations : 54891
% 5.27/1.18 % Factorizations : 0
% 5.27/1.18 % NegExts : 0
% 5.27/1.18 % Equation resolutions : 0
% 5.27/1.18 % Disequality decompositions : 0
% 5.27/1.18 % Total rewrite steps : 68758
% 5.27/1.18 % ...of those cached : 27169
% 5.27/1.18 % Propositional unsat checks : 0
% 5.27/1.18 % Propositional check models : 0
% 5.27/1.18 % Propositional check unsatisfiable : 0
% 5.27/1.18 % Propositional clauses : 0
% 5.27/1.18 % Propositional clauses after purity: 0
% 5.27/1.18 % Propositional unsat core size : 0
% 5.27/1.18 % Propositional preprocessing time : 0.000
% 5.27/1.18 % Propositional encoding time : 0.000
% 5.27/1.18 % Propositional solver time : 0.000
% 5.27/1.18 % Success case prop preproc time : 0.000
% 5.27/1.18 % Success case prop encoding time : 0.000
% 5.27/1.18 % Success case prop solver time : 0.000
% 5.27/1.18 % Current number of processed clauses : 723
% 5.27/1.18 % Positive orientable unit clauses : 723
% 5.27/1.18 % Positive unorientable unit clauses: 0
% 5.27/1.18 % Negative unit clauses : 0
% 5.27/1.18 % Non-unit-clauses : 0
% 5.27/1.18 % Current number of unprocessed clauses: 8296
% 5.27/1.18 % ...number of literals in the above : 8296
% 5.27/1.18 % Current number of archived formulas : 0
% 5.27/1.18 % Current number of archived clauses : 2
% 5.27/1.18 % Clause-clause subsumption calls (NU) : 0
% 5.27/1.18 % Rec. Clause-clause subsumption calls : 0
% 5.27/1.18 % Non-unit clause-clause subsumptions : 0
% 5.27/1.18 % Unit Clause-clause subsumption calls : 0
% 5.27/1.18 % Rewrite failures with RHS unbound : 0
% 5.27/1.18 % BW rewrite match attempts : 47094
% 5.27/1.18 % BW rewrite match successes : 1
% 5.27/1.18 % Condensation attempts : 0
% 5.27/1.18 % Condensation successes : 0
% 5.27/1.18 % Termbank termtop insertions : 974289
% 5.27/1.18 % Search garbage collected termcells : 2
% 5.27/1.18
% 5.27/1.18 % -------------------------------------------------
% 5.27/1.18 % User time : 0.705 s
% 5.27/1.18 % System time : 0.029 s
% 5.27/1.18 % Total time : 0.734 s
% 5.27/1.18 % Maximum resident set size: 3380 pages
% 5.27/1.18
% 5.27/1.18 % -------------------------------------------------
% 5.27/1.18 % User time : 3.534 s
% 5.27/1.18 % System time : 0.166 s
% 5.27/1.18 % Total time : 3.700 s
% 5.27/1.18 % Maximum resident set size: 4608 pages
% 5.27/1.18 % E exiting
%------------------------------------------------------------------------------