%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN138-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:13 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 52 ( 22 unt; 0 nHn; 45 RR)
% Number of literals : 105 ( 0 equ; 56 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 70 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_021,axiom,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).
cnf(axiom_28,axiom,
k0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_28) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(rule_127,axiom,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_129,axiom,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_124,axiom,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_124) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(axiom_1,axiom,
s0(d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).
cnf(rule_231,axiom,
( ~ k2(c,X2)
| ~ r2(X1)
| m3(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_231) ).
cnf(rule_188,axiom,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_188) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(prove_this,negated_conjecture,
~ m3(c,e,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_15,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_021]) ).
cnf(c_0_16,plain,
( ~ k0(X2)
| ~ l0(X1)
| m1(X1,X2,X1) ),
c_0_15 ).
cnf(c_0_17,axiom,
k0(e),
axiom_28 ).
cnf(c_0_18,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_19,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_20,plain,
( ~ l0(X1)
| m1(X1,e,X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
l0(c),
axiom_24 ).
cnf(c_0_22,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_23,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_18 ).
cnf(c_0_24,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_25,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_26,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
inference(fof_simplification,[status(thm)],[rule_124]) ).
cnf(c_0_27,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_19 ).
cnf(c_0_28,plain,
m1(c,e,c),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_22 ).
cnf(c_0_30,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_25 ).
cnf(c_0_32,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_33,plain,
( ~ q1(d,X2,d)
| ~ s0(d)
| ~ q0(X1,X2)
| r1(X1) ),
c_0_26 ).
cnf(c_0_34,axiom,
s0(d),
axiom_1 ).
cnf(c_0_35,plain,
( ~ k2(c,X2)
| ~ r2(X1)
| m3(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_231]) ).
cnf(c_0_36,plain,
( ~ k1(X1)
| ~ k2(X1,e)
| k2(c,e) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_37,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
k1(e),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
inference(fof_simplification,[status(thm)],[rule_188]) ).
cnf(c_0_40,plain,
( ~ q0(X1,X2)
| ~ q1(d,X2,d)
| r1(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_41,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_42,plain,
( ~ k2(c,X2)
| ~ r2(X1)
| m3(X1,X2,X1) ),
c_0_35 ).
cnf(c_0_43,plain,
k2(c,e),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).
cnf(c_0_44,plain,
( ~ l0(X1)
| ~ r1(X1)
| r2(X1) ),
c_0_39 ).
cnf(c_0_45,plain,
r1(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30])]) ).
cnf(c_0_46,negated_conjecture,
~ m3(c,e,c),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_47,plain,
( ~ r2(X1)
| m3(X1,e,X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( ~ l0(X1)
| r2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
~ m3(c,e,c),
c_0_46 ).
cnf(c_0_50,plain,
( ~ l0(X1)
| m3(X1,e,X1) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN138-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.37 % Computer : n026.cluster.edu
% 0.13/0.37 % Model : x86_64 x86_64
% 0.13/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.37 % Memory : 8046.5625MB
% 0.13/0.37 % OS : Linux 6.8.0-71-generic
% 0.13/0.37 % CPULimit : 300
% 0.13/0.37 % WCLimit : 300
% 0.13/0.37 % DateTime : Mon Sep 21 10:46:51 UTC 2026
% 0.13/0.37 % CPUTime :
% 0.13/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 Running first-order theorem proving
% 0.13/0.42 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.17/0.50 % Version: 3.5.1
% 0.17/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 % Starting sh5l with 300s (1) cores
% 0.17/0.50 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2067180 completed with status 0
% 0.17/0.50 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.17/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.50 % No SInE strategy applied
% 0.17/0.50 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.17/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.50 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.50 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.50 % SubtermCWHack with pid 2067191 completed with status 0
% 0.17/0.50 % Result found by SubtermCWHack
% 0.17/0.50 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.50 % No SInE strategy applied
% 0.17/0.50 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.17/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.50 % Preprocessing time : 0.005 s
% 0.17/0.50
% 0.17/0.50 % Proof found!
% 0.17/0.50 % SZS status Unsatisfiable
% 0.17/0.50 % SZS output start CNFRefutation
% See solution above
% 0.17/0.51 % Parsed axioms : 369
% 0.17/0.51 % Removed by relevancy pruning/SinE : 0
% 0.17/0.51 % Initial clauses : 369
% 0.17/0.51 % Removed in clause preprocessing : 7
% 0.17/0.51 % Initial clauses in saturation : 362
% 0.17/0.51 % Processed clauses : 637
% 0.17/0.51 % ...of these trivial : 86
% 0.17/0.51 % ...subsumed : 10
% 0.17/0.51 % ...remaining for further processing : 541
% 0.17/0.51 % Other redundant clauses eliminated : 0
% 0.17/0.51 % Clauses deleted for lack of memory : 0
% 0.17/0.51 % Backward-subsumed : 41
% 0.17/0.51 % Backward-rewritten : 191
% 0.17/0.51 % Generated clauses : 639
% 0.17/0.51 % ...of the previous two non-redundant : 459
% 0.17/0.51 % ...aggressively subsumed : 0
% 0.17/0.51 % Contextual simplify-reflections : 0
% 0.17/0.51 % Paramodulations : 639
% 0.17/0.51 % Factorizations : 0
% 0.17/0.51 % NegExts : 0
% 0.17/0.51 % Equation resolutions : 0
% 0.17/0.51 % Disequality decompositions : 0
% 0.17/0.51 % Total rewrite steps : 625
% 0.17/0.51 % ...of those cached : 367
% 0.17/0.51 % Propositional unsat checks : 0
% 0.17/0.51 % Propositional check models : 0
% 0.17/0.51 % Propositional check unsatisfiable : 0
% 0.17/0.51 % Propositional clauses : 0
% 0.17/0.51 % Propositional clauses after purity: 0
% 0.17/0.51 % Propositional unsat core size : 0
% 0.17/0.51 % Propositional preprocessing time : 0.000
% 0.17/0.51 % Propositional encoding time : 0.000
% 0.17/0.51 % Propositional solver time : 0.000
% 0.17/0.51 % Success case prop preproc time : 0.000
% 0.17/0.51 % Success case prop encoding time : 0.000
% 0.17/0.51 % Success case prop solver time : 0.000
% 0.17/0.51 % Current number of processed clauses : 309
% 0.17/0.51 % Positive orientable unit clauses : 160
% 0.17/0.51 % Positive unorientable unit clauses: 0
% 0.17/0.51 % Negative unit clauses : 1
% 0.17/0.51 % Non-unit-clauses : 148
% 0.17/0.51 % Current number of unprocessed clauses: 128
% 0.17/0.51 % ...number of literals in the above : 471
% 0.17/0.51 % Current number of archived formulas : 0
% 0.17/0.51 % Current number of archived clauses : 232
% 0.17/0.51 % Clause-clause subsumption calls (NU) : 8128
% 0.17/0.51 % Rec. Clause-clause subsumption calls : 7152
% 0.17/0.51 % Non-unit clause-clause subsumptions : 42
% 0.17/0.51 % Unit Clause-clause subsumption calls : 1255
% 0.17/0.51 % Rewrite failures with RHS unbound : 0
% 0.17/0.51 % BW rewrite match attempts : 236
% 0.17/0.51 % BW rewrite match successes : 159
% 0.17/0.51 % Condensation attempts : 0
% 0.17/0.51 % Condensation successes : 0
% 0.17/0.51 % Termbank termtop insertions : 18971
% 0.17/0.51 % Search garbage collected termcells : 1461
% 0.17/0.51
% 0.17/0.51 % -------------------------------------------------
% 0.17/0.51 % User time : 0.051 s
% 0.17/0.51 % System time : 0.008 s
% 0.17/0.51 % Total time : 0.058 s
% 0.17/0.51 % Maximum resident set size: 4420 pages
% 0.17/0.51
% 0.17/0.51 % -------------------------------------------------
% 0.17/0.51 % User time : 0.194 s
% 0.17/0.51 % System time : 0.028 s
% 0.17/0.51 % Total time : 0.222 s
% 0.17/0.51 % Maximum resident set size: 5120 pages
% 0.17/0.51 % E exiting
%------------------------------------------------------------------------------