%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:51 PM UTC 2026
% Result : Unsatisfiable 35.26s 5.69s
% Output : CNFRefutation 35.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 27 ( 26 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 57 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_2,axiom,
ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).
cnf(axiom_1_5,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_5) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(rule_1,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).
cnf(axiom_1_4,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).
cnf(rule_3,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_3) ).
cnf(axiom_1_3,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).
cnf(prove_this,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_8,axiom,
ifeq(theorem(X1),true,ifeq(axiom(or(not(X1),X2)),true,theorem(X2),true),true) = true,
rule_2 ).
cnf(c_0_9,axiom,
axiom(or(not(or(X1,or(X2,X3))),or(X2,or(X1,X3)))) = true,
axiom_1_5 ).
cnf(c_0_10,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_11,axiom,
ifeq(axiom(X1),true,theorem(X1),true) = true,
rule_1 ).
cnf(c_0_12,axiom,
axiom(or(not(or(X1,X2)),or(X2,X1))) = true,
axiom_1_4 ).
cnf(c_0_13,axiom,
ifeq(theorem(or(not(X1),X2)),true,ifeq(axiom(or(not(X3),X1)),true,theorem(or(not(X3),X2)),true),true) = true,
rule_3 ).
cnf(c_0_14,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_8,c_0_9]),c_0_10]) ).
cnf(c_0_15,plain,
theorem(or(not(or(X1,X2)),or(X2,X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_10]) ).
cnf(c_0_16,axiom,
axiom(or(not(X1),or(X2,X1))) = true,
axiom_1_3 ).
cnf(c_0_17,plain,
ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(or(X2,X1)),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_10]) ).
cnf(c_0_18,plain,
theorem(or(X1,or(not(or(X2,X1)),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10]) ).
cnf(c_0_19,plain,
ifeq(theorem(or(not(or(X1,X2)),X3)),true,theorem(or(not(X2),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_16]),c_0_10]) ).
cnf(c_0_20,plain,
theorem(or(not(or(X1,X2)),or(not(or(X3,not(or(X2,X1)))),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10]) ).
cnf(c_0_21,plain,
theorem(or(not(X1),or(not(or(X2,not(or(X1,X3)))),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]) ).
cnf(c_0_22,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_23,plain,
theorem(or(not(or(X1,not(or(X2,X3)))),or(not(X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_10]) ).
cnf(c_0_24,negated_conjecture,
theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))) != true,
c_0_22 ).
cnf(c_0_25,plain,
theorem(or(not(or(not(or(X1,X2)),X3)),or(not(X1),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_10]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL218-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.51 % Computer : n001.cluster.edu
% 0.07/0.51 % Model : x86_64 x86_64
% 0.07/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.51 % Memory : 8046.5625MB
% 0.07/0.51 % OS : Linux 6.8.0-71-generic
% 0.07/0.51 % CPULimit : 300
% 0.07/0.51 % WCLimit : 300
% 0.07/0.51 % DateTime : Mon Sep 21 00:17:14 UTC 2026
% 0.07/0.51 % CPUTime :
% 0.07/0.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.56 Running first-order theorem proving
% 0.07/0.56 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
% 35.26/5.69 % Version: 3.5.1
% 35.26/5.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.26/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.26/5.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.26/5.69 % Starting new_bool_3 with 300s (1) cores
% 35.26/5.69 % Starting new_bool_1 with 300s (1) cores
% 35.26/5.69 % Starting sh5l with 300s (1) cores
% 35.26/5.69 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1791797 completed with status 0
% 35.26/5.69 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 35.26/5.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.26/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.26/5.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.26/5.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.26/5.69 % No SInE strategy applied
% 35.26/5.69 % Search class: FUUPM-FFSF31-DFFFFFNN
% 35.26/5.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.26/5.69 % Starting SubtermCWHack with 136s (1) cores
% 35.26/5.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 35.26/5.69 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 254s (1) cores
% 35.26/5.69 % Starting new_bool_3 with 254s (1) cores
% 35.26/5.69 % Starting new_bool_1 with 254s (1) cores
% 35.26/5.69 % SubtermCWHack with pid 1791801 completed with status 0
% 35.26/5.69 % Result found by SubtermCWHack
% 35.26/5.69 % Preprocessing class: FSMSSMSSSSSNFFN.
% 35.26/5.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 35.26/5.69 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 35.26/5.69 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 35.26/5.69 % No SInE strategy applied
% 35.26/5.69 % Search class: FUUPM-FFSF31-DFFFFFNN
% 35.26/5.69 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 35.26/5.69 % Starting SubtermCWHack with 136s (1) cores
% 35.26/5.69 % Preprocessing time : 0.001 s
% 35.26/5.69
% 35.26/5.69 % Proof found!
% 35.26/5.69 % SZS status Unsatisfiable
% 35.26/5.69 % SZS output start CNFRefutation
% See solution above
% 35.26/5.69 % Parsed axioms : 10
% 35.26/5.69 % Removed by relevancy pruning/SinE : 0
% 35.26/5.69 % Initial clauses : 10
% 35.26/5.69 % Removed in clause preprocessing : 0
% 35.26/5.69 % Initial clauses in saturation : 10
% 35.26/5.69 % Processed clauses : 3100
% 35.26/5.69 % ...of these trivial : 287
% 35.26/5.69 % ...subsumed : 0
% 35.26/5.69 % ...remaining for further processing : 2813
% 35.26/5.69 % Other redundant clauses eliminated : 0
% 35.26/5.69 % Clauses deleted for lack of memory : 0
% 35.26/5.69 % Backward-subsumed : 0
% 35.26/5.69 % Backward-rewritten : 1
% 35.26/5.69 % Generated clauses : 342413
% 35.26/5.69 % ...of the previous two non-redundant : 13552
% 35.26/5.69 % ...aggressively subsumed : 0
% 35.26/5.69 % Contextual simplify-reflections : 0
% 35.26/5.69 % Paramodulations : 342413
% 35.26/5.69 % Factorizations : 0
% 35.26/5.69 % NegExts : 0
% 35.26/5.69 % Equation resolutions : 0
% 35.26/5.69 % Disequality decompositions : 0
% 35.26/5.69 % Total rewrite steps : 356851
% 35.26/5.69 % ...of those cached : 36188
% 35.26/5.69 % Propositional unsat checks : 0
% 35.26/5.69 % Propositional check models : 0
% 35.26/5.69 % Propositional check unsatisfiable : 0
% 35.26/5.69 % Propositional clauses : 0
% 35.26/5.69 % Propositional clauses after purity: 0
% 35.26/5.69 % Propositional unsat core size : 0
% 35.26/5.69 % Propositional preprocessing time : 0.000
% 35.26/5.69 % Propositional encoding time : 0.000
% 35.26/5.69 % Propositional solver time : 0.000
% 35.26/5.69 % Success case prop preproc time : 0.000
% 35.26/5.69 % Success case prop encoding time : 0.000
% 35.26/5.69 % Success case prop solver time : 0.000
% 35.26/5.69 % Current number of processed clauses : 2812
% 35.26/5.69 % Positive orientable unit clauses : 2812
% 35.26/5.69 % Positive unorientable unit clauses: 0
% 35.26/5.69 % Negative unit clauses : 0
% 35.26/5.69 % Non-unit-clauses : 0
% 35.26/5.69 % Current number of unprocessed clauses: 10462
% 35.26/5.69 % ...number of literals in the above : 10462
% 35.26/5.69 % Current number of archived formulas : 0
% 35.26/5.69 % Current number of archived clauses : 1
% 35.26/5.69 % Clause-clause subsumption calls (NU) : 0
% 35.26/5.69 % Rec. Clause-clause subsumption calls : 0
% 35.26/5.69 % Non-unit clause-clause subsumptions : 0
% 35.26/5.69 % Unit Clause-clause subsumption calls : 0
% 35.26/5.69 % Rewrite failures with RHS unbound : 0
% 35.26/5.69 % BW rewrite match attempts : 1054784
% 35.26/5.69 % BW rewrite match successes : 1
% 35.26/5.69 % Condensation attempts : 0
% 35.26/5.69 % Condensation successes : 0
% 35.26/5.69 % Termbank termtop insertions : 8696311
% 35.26/5.69 % Search garbage collected termcells : 2
% 35.26/5.69
% 35.26/5.69 % -------------------------------------------------
% 35.26/5.69 % User time : 4.917 s
% 35.26/5.69 % System time : 0.112 s
% 35.26/5.69 % Total time : 5.029 s
% 35.26/5.69 % Maximum resident set size: 3588 pages
% 35.26/5.69
% 35.26/5.69 % -------------------------------------------------
% 35.26/5.69 % User time : 24.378 s
% 35.26/5.69 % System time : 0.603 s
% 35.26/5.69 % Total time : 24.982 s
% 35.26/5.69 % Maximum resident set size: 4864 pages
% 35.26/5.69 % E exiting
%------------------------------------------------------------------------------