%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN272-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 : 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:32 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of clauses : 53 ( 23 unt; 0 nHn; 44 RR)
% Number of literals : 97 ( 0 equ; 48 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 82 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_007,axiom,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_007) ).
cnf(rule_029,axiom,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_029) ).
cnf(rule_110,axiom,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_110) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
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_5,axiom,
s0(b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
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(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(axiom_15,axiom,
n0(a,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_15) ).
cnf(rule_194,axiom,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_194) ).
cnf(prove_this,negated_conjecture,
~ p4(d,e,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_287,axiom,
( ~ k3(X1,X1,X2)
| p4(X1,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_287) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(c_0_15,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_007]) ).
cnf(c_0_16,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_17,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_18,plain,
( ~ r0(X1)
| ~ p0(X3,X2)
| m1(X1,X2,X1) ),
c_0_15 ).
cnf(c_0_19,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_20,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_21,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_16 ).
cnf(c_0_22,axiom,
s0(b),
axiom_5 ).
cnf(c_0_23,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_24,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_17 ).
cnf(c_0_25,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_26,plain,
( ~ r0(X1)
| m1(X1,X2,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,axiom,
r0(e),
axiom_13 ).
cnf(c_0_28,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_20 ).
cnf(c_0_29,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_19]),c_0_22])]) ).
cnf(c_0_30,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_23 ).
cnf(c_0_31,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_33,plain,
m1(e,X1,e),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_32 ).
cnf(c_0_37,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_38,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_194]) ).
cnf(c_0_39,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(e,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_40,plain,
( ~ k1(X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
k1(b),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
~ p4(d,e,X1),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_43,plain,
( ~ k3(X1,X1,X2)
| p4(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_287]) ).
cnf(c_0_44,plain,
( ~ k2(X2,X1)
| k3(X1,X1,X2) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ k1(X1)
| k2(e,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).
cnf(c_0_46,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_47,negated_conjecture,
~ p4(d,e,X1),
c_0_42 ).
cnf(c_0_48,plain,
( ~ k3(X1,X1,X2)
| p4(X1,X2,X1) ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ k1(X1)
| k3(X1,X1,e) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
k1(d),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_51,negated_conjecture,
~ k3(d,d,e),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_52,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN272-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.10/0.35 % Computer : n014.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 10:47:35 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40 Running first-order theorem proving
% 0.14/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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3877386 completed with status 0
% 0.14/0.46 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.14/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.46 % SubtermCWHack with pid 3877390 completed with status 0
% 0.14/0.46 % Result found by SubtermCWHack
% 0.14/0.46 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.46 % No SInE strategy applied
% 0.14/0.46 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.14/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.46 % Preprocessing time : 0.005 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 369
% 0.14/0.46 % Removed by relevancy pruning/SinE : 0
% 0.14/0.46 % Initial clauses : 369
% 0.14/0.46 % Removed in clause preprocessing : 7
% 0.14/0.46 % Initial clauses in saturation : 362
% 0.14/0.46 % Processed clauses : 664
% 0.14/0.46 % ...of these trivial : 88
% 0.14/0.46 % ...subsumed : 14
% 0.14/0.46 % ...remaining for further processing : 562
% 0.14/0.46 % Other redundant clauses eliminated : 0
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 40
% 0.14/0.46 % Backward-rewritten : 194
% 0.14/0.46 % Generated clauses : 682
% 0.14/0.46 % ...of the previous two non-redundant : 487
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 0
% 0.14/0.46 % Paramodulations : 682
% 0.14/0.46 % Factorizations : 0
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 0
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 674
% 0.14/0.46 % ...of those cached : 409
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 328
% 0.14/0.46 % Positive orientable unit clauses : 171
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 2
% 0.14/0.46 % Non-unit-clauses : 155
% 0.14/0.46 % Current number of unprocessed clauses: 120
% 0.14/0.46 % ...number of literals in the above : 442
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 234
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 8546
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 7543
% 0.14/0.46 % Non-unit clause-clause subsumptions : 45
% 0.14/0.46 % Unit Clause-clause subsumption calls : 1270
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 246
% 0.14/0.46 % BW rewrite match successes : 162
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 19426
% 0.14/0.46 % Search garbage collected termcells : 1461
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.033 s
% 0.14/0.46 % System time : 0.008 s
% 0.14/0.46 % Total time : 0.041 s
% 0.14/0.46 % Maximum resident set size: 4472 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.153 s
% 0.14/0.46 % System time : 0.029 s
% 0.14/0.46 % Total time : 0.182 s
% 0.14/0.46 % Maximum resident set size: 4864 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------