%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL203-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 : n017.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:05 PM UTC 2026
% Result : Unsatisfiable 2.49s 0.87s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% 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 : 7 ( 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 : 87 ( 15 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_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_4,axiom,
axiom(implies(or(X1,X2),or(X2,X1))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_4) ).
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(or(p,q)),or(not(p),not(q)))) != 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,
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,axiom,
axiom(implies(implies(X1,X2),implies(or(X3,X1),or(X3,X2)))) = true,
axiom_1_6 ).
cnf(c_0_21,plain,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,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_23,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_24,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_20,c_0_10]),c_0_10]),c_0_10]) ).
cnf(c_0_25,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_21]),c_0_14]) ).
cnf(c_0_26,plain,
theorem(or(X1,or(not(X2),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_14]) ).
cnf(c_0_27,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_12,c_0_24]),c_0_14]) ).
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_17,c_0_25]),c_0_14]) ).
cnf(c_0_29,plain,
theorem(or(not(X1),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_26]),c_0_14]) ).
cnf(c_0_30,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_17,c_0_27]),c_0_14]) ).
cnf(c_0_31,plain,
theorem(or(X1,not(X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_14]) ).
cnf(c_0_32,plain,
theorem(or(not(or(X1,X2)),or(X1,not(not(X2))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_14]) ).
cnf(c_0_33,plain,
theorem(or(not(X1),not(not(or(X2,X1))))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_14]) ).
cnf(c_0_34,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_35,plain,
ifeq(theorem(X1),true,theorem(or(X2,X1)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
cnf(c_0_36,plain,
theorem(or(not(not(or(X1,X2))),not(X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_33]),c_0_14]) ).
cnf(c_0_37,negated_conjecture,
theorem(implies(not(or(p,q)),or(not(p),not(q)))) != true,
c_0_34 ).
cnf(c_0_38,plain,
ifeq(theorem(or(X1,or(X2,X3))),true,theorem(or(X2,or(X1,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_14]) ).
cnf(c_0_39,plain,
theorem(or(X1,or(not(not(or(X2,X3))),not(X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_14]) ).
cnf(c_0_40,negated_conjecture,
theorem(or(not(not(or(p,q))),or(not(p),not(q)))) != true,
inference(rw,[status(thm)],[c_0_37,c_0_10]) ).
cnf(c_0_41,plain,
theorem(or(not(not(or(X1,X2))),or(X3,not(X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_14]) ).
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.03 % Problem : LCL203-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.38 % Computer : n017.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 21 00:06:13 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.46 Running first-order theorem proving
% 0.16/0.46 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
% 2.49/0.87 % Version: 3.5.1
% 2.49/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.49/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.49/0.87 % Starting new_bool_3 with 300s (1) cores
% 2.49/0.87 % Starting new_bool_1 with 300s (1) cores
% 2.49/0.87 % Starting sh5l with 300s (1) cores
% 2.49/0.87 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 992294 completed with status 0
% 2.49/0.87 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 2.49/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.49/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.49/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.49/0.87 % No SInE strategy applied
% 2.49/0.87 % Search class: FUUPM-FFSF31-MFFFFFNN
% 2.49/0.87 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.49/0.87 % Starting SubtermCWHack with 151s (1) cores
% 2.49/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 2.49/0.87 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 2.49/0.87 % Starting new_bool_3 with 251s (1) cores
% 2.49/0.87 % Starting new_bool_1 with 251s (1) cores
% 2.49/0.87 % G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with pid 992299 completed with status 0
% 2.49/0.87 % Result found by G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 2.49/0.87 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.49/0.87 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.49/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.49/0.87 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.49/0.87 % No SInE strategy applied
% 2.49/0.87 % Search class: FUUPM-FFSF31-MFFFFFNN
% 2.49/0.87 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 2.49/0.87 % Starting SubtermCWHack with 151s (1) cores
% 2.49/0.87 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 500s (1) cores
% 2.49/0.87 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 251s (1) cores
% 2.49/0.87 % Preprocessing time : 0.002 s
% 2.49/0.87
% 2.49/0.87 % Proof found!
% 2.49/0.87 % SZS status Unsatisfiable
% 2.49/0.87 % SZS output start CNFRefutation
% See solution above
% 2.49/0.87 % Parsed axioms : 10
% 2.49/0.87 % Removed by relevancy pruning/SinE : 0
% 2.49/0.87 % Initial clauses : 10
% 2.49/0.87 % Removed in clause preprocessing : 1
% 2.49/0.87 % Initial clauses in saturation : 9
% 2.49/0.87 % Processed clauses : 344
% 2.49/0.87 % ...of these trivial : 34
% 2.49/0.87 % ...subsumed : 0
% 2.49/0.87 % ...remaining for further processing : 310
% 2.49/0.87 % Other redundant clauses eliminated : 0
% 2.49/0.87 % Clauses deleted for lack of memory : 0
% 2.49/0.87 % Backward-subsumed : 0
% 2.49/0.87 % Backward-rewritten : 1
% 2.49/0.87 % Generated clauses : 11205
% 2.49/0.87 % ...of the previous two non-redundant : 2244
% 2.49/0.87 % ...aggressively subsumed : 0
% 2.49/0.87 % Contextual simplify-reflections : 0
% 2.49/0.87 % Paramodulations : 11205
% 2.49/0.87 % Factorizations : 0
% 2.49/0.87 % NegExts : 0
% 2.49/0.87 % Equation resolutions : 0
% 2.49/0.87 % Disequality decompositions : 0
% 2.49/0.87 % Total rewrite steps : 14472
% 2.49/0.87 % ...of those cached : 6305
% 2.49/0.87 % Propositional unsat checks : 0
% 2.49/0.87 % Propositional check models : 0
% 2.49/0.87 % Propositional check unsatisfiable : 0
% 2.49/0.87 % Propositional clauses : 0
% 2.49/0.87 % Propositional clauses after purity: 0
% 2.49/0.87 % Propositional unsat core size : 0
% 2.49/0.87 % Propositional preprocessing time : 0.000
% 2.49/0.87 % Propositional encoding time : 0.000
% 2.49/0.87 % Propositional solver time : 0.000
% 2.49/0.87 % Success case prop preproc time : 0.000
% 2.49/0.87 % Success case prop encoding time : 0.000
% 2.49/0.87 % Success case prop solver time : 0.000
% 2.49/0.87 % Current number of processed clauses : 309
% 2.49/0.87 % Positive orientable unit clauses : 309
% 2.49/0.87 % Positive unorientable unit clauses: 0
% 2.49/0.87 % Negative unit clauses : 0
% 2.49/0.87 % Non-unit-clauses : 0
% 2.49/0.87 % Current number of unprocessed clauses: 1909
% 2.49/0.87 % ...number of literals in the above : 1909
% 2.49/0.87 % Current number of archived formulas : 0
% 2.49/0.87 % Current number of archived clauses : 2
% 2.49/0.87 % Clause-clause subsumption calls (NU) : 0
% 2.49/0.87 % Rec. Clause-clause subsumption calls : 0
% 2.49/0.87 % Non-unit clause-clause subsumptions : 0
% 2.49/0.87 % Unit Clause-clause subsumption calls : 0
% 2.49/0.87 % Rewrite failures with RHS unbound : 0
% 2.49/0.87 % BW rewrite match attempts : 10385
% 2.49/0.87 % BW rewrite match successes : 1
% 2.49/0.87 % Condensation attempts : 0
% 2.49/0.87 % Condensation successes : 0
% 2.49/0.87 % Termbank termtop insertions : 197006
% 2.49/0.87 % Search garbage collected termcells : 2
% 2.49/0.87
% 2.49/0.87 % -------------------------------------------------
% 2.49/0.87 % User time : 0.249 s
% 2.49/0.87 % System time : 0.015 s
% 2.49/0.87 % Total time : 0.265 s
% 2.49/0.87 % Maximum resident set size: 3380 pages
% 2.49/0.87
% 2.49/0.87 % -------------------------------------------------
% 2.49/0.87 % User time : 1.560 s
% 2.49/0.87 % System time : 0.090 s
% 2.49/0.87 % Total time : 1.650 s
% 2.49/0.87 % Maximum resident set size: 4608 pages
% 2.49/0.87 % E exiting
%------------------------------------------------------------------------------