%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN100-1.005 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 03:23:07 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.42s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of clauses : 63 ( 14 unt; 0 nHn; 63 RR)
% Number of literals : 159 ( 0 equ; 104 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 49 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(m_s3_goal_1,negated_conjecture,
( ~ q_0(X1)
| ~ p_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_goal_1) ).
cnf(m_s3_type12_1,axiom,
( ~ q_2(X1)
| ~ p_1(X1)
| q_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type12_1) ).
cnf(m_s3_type11_1,axiom,
( ~ p_2(X1)
| ~ p_1(X1)
| p_0(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_1) ).
cnf(m_s3_type11_15,axiom,
( ~ p_9(X1)
| ~ p_8(X1)
| p_7(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_15) ).
cnf(m_s3_type11_3,axiom,
( ~ p_3(X1)
| ~ p_2(X1)
| p_1(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_3) ).
cnf(m_s3_type11_5,axiom,
( ~ p_4(X1)
| ~ p_3(X1)
| p_2(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_5) ).
cnf(m_s3_type11_7,axiom,
( ~ p_5(X1)
| ~ p_4(X1)
| p_3(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_7) ).
cnf(m_s3_type12_13,axiom,
( ~ q_8(X1)
| ~ p_7(X1)
| q_6(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type12_13) ).
cnf(m_t3_2,axiom,
p_9(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_t3_2) ).
cnf(m_t3_1,axiom,
p_8(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_t3_1) ).
cnf(m_s3_type11_13,axiom,
( ~ p_8(X1)
| ~ p_7(X1)
| p_6(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_13) ).
cnf(m_s3_type12_5,axiom,
( ~ q_4(X1)
| ~ p_3(X1)
| q_2(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type12_5) ).
cnf(m_s3_type12_12,axiom,
( ~ p_7(X1)
| ~ q_6(X1)
| q_5(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type12_12) ).
cnf(m_t3_3,axiom,
q_8(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_t3_3) ).
cnf(m_s3_type11_11,axiom,
( ~ p_7(X1)
| ~ p_6(X1)
| p_5(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_11) ).
cnf(m_s3_type12_10,axiom,
( ~ p_6(X1)
| ~ q_5(X1)
| q_4(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type12_10) ).
cnf(m_s3_type11_9,axiom,
( ~ p_6(X1)
| ~ p_5(X1)
| p_4(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_s3_type11_9) ).
cnf(c_0_17,negated_conjecture,
( ~ q_0(X1)
| ~ p_0(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_goal_1]) ).
cnf(c_0_18,plain,
( ~ q_2(X1)
| ~ p_1(X1)
| q_0(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type12_1]) ).
cnf(c_0_19,negated_conjecture,
( ~ q_0(X1)
| ~ p_0(X1) ),
c_0_17 ).
cnf(c_0_20,plain,
( ~ q_2(X1)
| ~ p_1(X1)
| q_0(X1) ),
c_0_18 ).
cnf(c_0_21,plain,
( ~ p_2(X1)
| ~ p_1(X1)
| p_0(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_1]) ).
cnf(c_0_22,plain,
( ~ p_9(X1)
| ~ p_8(X1)
| p_7(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ p_0(X1)
| ~ p_1(X1)
| ~ q_2(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ p_2(X1)
| ~ p_1(X1)
| p_0(X1) ),
c_0_21 ).
cnf(c_0_25,plain,
( ~ p_3(X1)
| ~ p_2(X1)
| p_1(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_3]) ).
cnf(c_0_26,plain,
( ~ p_4(X1)
| ~ p_3(X1)
| p_2(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_5]) ).
cnf(c_0_27,plain,
( ~ p_5(X1)
| ~ p_4(X1)
| p_3(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_7]) ).
cnf(c_0_28,plain,
( ~ q_8(X1)
| ~ p_7(X1)
| q_6(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type12_13]) ).
cnf(c_0_29,plain,
( ~ p_9(X1)
| ~ p_8(X1)
| p_7(X1) ),
c_0_22 ).
cnf(c_0_30,axiom,
p_9(a),
m_t3_2 ).
cnf(c_0_31,axiom,
p_8(a),
m_t3_1 ).
cnf(c_0_32,plain,
( ~ p_8(X1)
| ~ p_7(X1)
| p_6(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_13]) ).
cnf(c_0_33,negated_conjecture,
( ~ p_1(X1)
| ~ p_2(X1)
| ~ q_2(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
( ~ p_3(X1)
| ~ p_2(X1)
| p_1(X1) ),
c_0_25 ).
cnf(c_0_35,plain,
( ~ p_4(X1)
| ~ p_3(X1)
| p_2(X1) ),
c_0_26 ).
cnf(c_0_36,plain,
( ~ p_5(X1)
| ~ p_4(X1)
| p_3(X1) ),
c_0_27 ).
cnf(c_0_37,plain,
( ~ q_4(X1)
| ~ p_3(X1)
| q_2(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type12_5]) ).
cnf(c_0_38,plain,
( ~ p_7(X1)
| ~ q_6(X1)
| q_5(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type12_12]) ).
cnf(c_0_39,plain,
( ~ q_8(X1)
| ~ p_7(X1)
| q_6(X1) ),
c_0_28 ).
cnf(c_0_40,axiom,
q_8(a),
m_t3_3 ).
cnf(c_0_41,plain,
p_7(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_42,plain,
( ~ p_7(X1)
| ~ p_6(X1)
| p_5(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_11]) ).
cnf(c_0_43,plain,
( ~ p_8(X1)
| ~ p_7(X1)
| p_6(X1) ),
c_0_32 ).
cnf(c_0_44,negated_conjecture,
( ~ p_2(X1)
| ~ q_2(X1)
| ~ p_3(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_45,plain,
( ~ p_4(X1)
| ~ p_5(X1)
| p_2(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_46,plain,
( ~ q_4(X1)
| ~ p_3(X1)
| q_2(X1) ),
c_0_37 ).
cnf(c_0_47,plain,
( ~ p_6(X1)
| ~ q_5(X1)
| q_4(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type12_10]) ).
cnf(c_0_48,plain,
( ~ p_7(X1)
| ~ q_6(X1)
| q_5(X1) ),
c_0_38 ).
cnf(c_0_49,plain,
q_6(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_50,plain,
( ~ p_6(X1)
| ~ p_5(X1)
| p_4(X1) ),
inference(fof_simplification,[status(thm)],[m_s3_type11_9]) ).
cnf(c_0_51,plain,
( ~ p_7(X1)
| ~ p_6(X1)
| p_5(X1) ),
c_0_42 ).
cnf(c_0_52,plain,
p_6(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_31]),c_0_41])]) ).
cnf(c_0_53,negated_conjecture,
( ~ q_2(X1)
| ~ p_4(X1)
| ~ p_5(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_36]),c_0_45]) ).
cnf(c_0_54,plain,
( ~ p_4(X1)
| ~ q_4(X1)
| ~ p_5(X1)
| q_2(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_36]) ).
cnf(c_0_55,plain,
( ~ p_6(X1)
| ~ q_5(X1)
| q_4(X1) ),
c_0_47 ).
cnf(c_0_56,plain,
q_5(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_41]),c_0_49])]) ).
cnf(c_0_57,plain,
( ~ p_6(X1)
| ~ p_5(X1)
| p_4(X1) ),
c_0_50 ).
cnf(c_0_58,plain,
p_5(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_41]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
( ~ p_4(X1)
| ~ q_4(X1)
| ~ p_5(X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_60,plain,
q_4(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_52]),c_0_56])]) ).
cnf(c_0_61,plain,
p_4(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_52]),c_0_58])]) ).
cnf(c_0_62,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_60]),c_0_61])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN100-1.005 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n014.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 10:43:19 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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
% 0.12/0.42 % Version: 3.5.1
% 0.12/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.42 % Starting sh5l with 300s (1) cores
% 0.12/0.42 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3863516 completed with status 0
% 0.12/0.42 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.12/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMS00-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.12/0.42 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.42 % Starting new_bool_3 with 136s (1) cores
% 0.12/0.42 % Starting new_bool_1 with 136s (1) cores
% 0.12/0.42 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 3863524 completed with status 0
% 0.12/0.42 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.12/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.12/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.12/0.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.42 % No SInE strategy applied
% 0.12/0.42 % Search class: FGHNF-FFMS00-SFFFFFNN
% 0.12/0.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.42 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.12/0.42 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.12/0.42 % Preprocessing time : 0.001 s
% 0.12/0.42 % Presaturation interreduction done
% 0.12/0.42
% 0.12/0.42 % Proof found!
% 0.12/0.42 % SZS status Unsatisfiable
% 0.12/0.42 % SZS output start CNFRefutation
% See solution above
% 0.12/0.42 % Parsed axioms : 82
% 0.12/0.42 % Removed by relevancy pruning/SinE : 0
% 0.12/0.42 % Initial clauses : 82
% 0.12/0.42 % Removed in clause preprocessing : 0
% 0.12/0.42 % Initial clauses in saturation : 82
% 0.12/0.42 % Processed clauses : 218
% 0.12/0.42 % ...of these trivial : 7
% 0.12/0.42 % ...subsumed : 11
% 0.12/0.42 % ...remaining for further processing : 200
% 0.12/0.42 % Other redundant clauses eliminated : 0
% 0.12/0.42 % Clauses deleted for lack of memory : 0
% 0.12/0.42 % Backward-subsumed : 2
% 0.12/0.42 % Backward-rewritten : 0
% 0.12/0.42 % Generated clauses : 98
% 0.12/0.42 % ...of the previous two non-redundant : 97
% 0.12/0.42 % ...aggressively subsumed : 0
% 0.12/0.42 % Contextual simplify-reflections : 2
% 0.12/0.42 % Paramodulations : 98
% 0.12/0.42 % Factorizations : 0
% 0.12/0.42 % NegExts : 0
% 0.12/0.42 % Equation resolutions : 0
% 0.12/0.42 % Disequality decompositions : 0
% 0.12/0.42 % Total rewrite steps : 24
% 0.12/0.42 % ...of those cached : 14
% 0.12/0.42 % Propositional unsat checks : 0
% 0.12/0.42 % Propositional check models : 0
% 0.12/0.42 % Propositional check unsatisfiable : 0
% 0.12/0.42 % Propositional clauses : 0
% 0.12/0.42 % Propositional clauses after purity: 0
% 0.12/0.42 % Propositional unsat core size : 0
% 0.12/0.42 % Propositional preprocessing time : 0.000
% 0.12/0.42 % Propositional encoding time : 0.000
% 0.12/0.42 % Propositional solver time : 0.000
% 0.12/0.42 % Success case prop preproc time : 0.000
% 0.12/0.42 % Success case prop encoding time : 0.000
% 0.12/0.42 % Success case prop solver time : 0.000
% 0.12/0.42 % Current number of processed clauses : 116
% 0.12/0.42 % Positive orientable unit clauses : 12
% 0.12/0.42 % Positive unorientable unit clauses: 0
% 0.12/0.42 % Negative unit clauses : 9
% 0.12/0.42 % Non-unit-clauses : 95
% 0.12/0.42 % Current number of unprocessed clauses: 43
% 0.12/0.42 % ...number of literals in the above : 138
% 0.12/0.42 % Current number of archived formulas : 0
% 0.12/0.42 % Current number of archived clauses : 84
% 0.12/0.42 % Clause-clause subsumption calls (NU) : 2861
% 0.12/0.42 % Rec. Clause-clause subsumption calls : 2280
% 0.12/0.42 % Non-unit clause-clause subsumptions : 11
% 0.12/0.42 % Unit Clause-clause subsumption calls : 137
% 0.12/0.42 % Rewrite failures with RHS unbound : 0
% 0.12/0.42 % BW rewrite match attempts : 0
% 0.12/0.42 % BW rewrite match successes : 0
% 0.12/0.42 % Condensation attempts : 0
% 0.12/0.42 % Condensation successes : 0
% 0.12/0.42 % Termbank termtop insertions : 4282
% 0.12/0.42 % Search garbage collected termcells : 157
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.005 s
% 0.12/0.42 % System time : 0.004 s
% 0.12/0.42 % Total time : 0.010 s
% 0.12/0.42 % Maximum resident set size: 3632 pages
% 0.12/0.42
% 0.12/0.42 % -------------------------------------------------
% 0.12/0.42 % User time : 0.031 s
% 0.12/0.42 % System time : 0.012 s
% 0.12/0.42 % Total time : 0.043 s
% 0.12/0.42 % Maximum resident set size: 4608 pages
% 0.12/0.42 % E exiting
%------------------------------------------------------------------------------