%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN205-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:22 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.53s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 22
% Syntax : Number of clauses : 81 ( 31 unt; 0 nHn; 62 RR)
% Number of literals : 174 ( 0 equ; 98 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 15 ( 14 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 127 ( 42 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_071,axiom,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_071) ).
cnf(rule_069,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_069) ).
cnf(rule_273,axiom,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_273) ).
cnf(rule_126,axiom,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_126) ).
cnf(rule_125,axiom,
( ~ p0(X1,X1)
| s1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_125) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_5) ).
cnf(rule_050,axiom,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_050) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).
cnf(prove_this,negated_conjecture,
~ s3(a,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
cnf(rule_189,axiom,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_189) ).
cnf(rule_182,axiom,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_182) ).
cnf(axiom_24,axiom,
l0(c),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_24) ).
cnf(rule_177,axiom,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_177) ).
cnf(rule_054,axiom,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_054) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_20) ).
cnf(rule_002,axiom,
( ~ n0(X2,X1)
| l1(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_002) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_32) ).
cnf(c_0_22,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_23,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_24,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_22 ).
cnf(c_0_25,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_26,plain,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_071]) ).
cnf(c_0_27,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_069]) ).
cnf(c_0_28,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_29,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_23 ).
cnf(c_0_30,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_32,plain,
( ~ p0(X1,X1)
| s1(X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_33,plain,
( ~ s0(b)
| ~ p1(X2,X4,X1)
| ~ l0(X3)
| p1(X1,X2,X1) ),
c_0_26 ).
cnf(c_0_34,axiom,
s0(b),
axiom_5 ).
cnf(c_0_35,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X2) ),
c_0_27 ).
cnf(c_0_36,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_050]) ).
cnf(c_0_37,plain,
( ~ m0(X3,X4,X2)
| ~ s2(X1)
| ~ q2(X3,X1,X3)
| s3(X1,X2) ),
c_0_28 ).
cnf(c_0_38,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_39,plain,
( ~ s1(X3)
| ~ q0(X1,X2)
| s1(X1) ),
c_0_31 ).
cnf(c_0_40,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_41,plain,
( ~ p0(X1,X1)
| s1(X1) ),
c_0_32 ).
cnf(c_0_42,plain,
( ~ l0(X4)
| ~ p1(X2,X3,X1)
| p1(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_43,plain,
p1(X1,X1,b),
inference(spm,[status(thm)],[c_0_35,c_0_25]) ).
cnf(c_0_44,plain,
( ~ p0(b,X2)
| ~ l0(X1)
| ~ s0(b)
| n1(X1,X2,X1) ),
c_0_36 ).
cnf(c_0_45,negated_conjecture,
~ s3(a,d),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_46,plain,
( ~ m0(X1,X3,X2)
| ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_47,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_48,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_49,plain,
( ~ s1(X2)
| s1(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_50,plain,
s1(b),
inference(spm,[status(thm)],[c_0_41,c_0_25]) ).
cnf(c_0_51,plain,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_182]) ).
cnf(c_0_52,plain,
( ~ l0(X2)
| p1(b,X1,b) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_53,axiom,
l0(c),
axiom_24 ).
cnf(c_0_54,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
cnf(c_0_55,plain,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
inference(fof_simplification,[status(thm)],[rule_054]) ).
cnf(c_0_56,plain,
( ~ l0(X1)
| n1(X1,X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_34]),c_0_25])]) ).
cnf(c_0_57,axiom,
l0(a),
axiom_20 ).
cnf(c_0_58,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_59,negated_conjecture,
~ s3(a,d),
c_0_45 ).
cnf(c_0_60,plain,
( ~ s2(X1)
| s3(X1,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_61,plain,
( ~ s1(b)
| ~ q2(b,X1,b)
| s2(X1) ),
c_0_48 ).
cnf(c_0_62,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_63,plain,
( ~ q2(X2,X3,X1)
| ~ n1(X2,X1,X3)
| ~ p1(X1,X1,X3)
| q2(X1,X2,X1) ),
c_0_51 ).
cnf(c_0_64,plain,
p1(b,X1,b),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_65,plain,
( ~ p1(X1,X1,X1)
| ~ k0(X2)
| q2(X1,X2,X2) ),
c_0_54 ).
cnf(c_0_66,plain,
( ~ n1(X1,X2,X1)
| ~ l1(X3,X1)
| ~ l0(X3)
| n1(X1,X2,X2) ),
c_0_55 ).
cnf(c_0_67,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_68,plain,
( ~ n0(X2,X1)
| l1(X1,X1) ),
c_0_58 ).
cnf(c_0_69,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_70,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_71,plain,
( ~ q2(b,X1,b)
| s2(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_72,plain,
( ~ n1(X1,b,b)
| ~ q2(X1,b,b)
| q2(b,X1,b) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_73,plain,
( ~ k0(X2)
| q2(X1,X2,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_30])]) ).
cnf(c_0_74,axiom,
k0(b),
axiom_32 ).
cnf(c_0_75,plain,
( ~ l0(X2)
| ~ l1(X2,a)
| n1(a,X1,X1) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_77,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
( ~ n1(X1,b,b)
| q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74])]) ).
cnf(c_0_79,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_57])]) ).
cnf(c_0_80,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN205-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.37 % Computer : n016.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 10:51:14 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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
% 0.15/5.53 % Version: 3.5.1
% 0.15/5.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.53 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.53 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.53 % Starting sh5l with 300s (1) cores
% 0.15/5.53 % new_bool_3 with pid 2242535 completed with status 0
% 0.15/5.53 % Result found by new_bool_3
% 0.15/5.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.53 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/5.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.53 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.53 % SubtermCWHack with pid 2242544 completed with status 0
% 0.15/5.53 % Result found by SubtermCWHack
% 0.15/5.53 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/5.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.53 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/5.53 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.53 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.15/5.53 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.53 % Starting SubtermCWHack with 31s (1) cores
% 0.15/5.53 % Preprocessing time : 0.003 s
% 0.15/5.53
% 0.15/5.53 % Proof found!
% 0.15/5.53 % SZS status Unsatisfiable
% 0.15/5.53 % SZS output start CNFRefutation
% See solution above
% 0.15/5.53 % Parsed axioms : 369
% 0.15/5.53 % Removed by relevancy pruning/SinE : 24
% 0.15/5.53 % Initial clauses : 345
% 0.15/5.53 % Removed in clause preprocessing : 6
% 0.15/5.53 % Initial clauses in saturation : 339
% 0.15/5.53 % Processed clauses : 1483
% 0.15/5.53 % ...of these trivial : 150
% 0.15/5.53 % ...subsumed : 236
% 0.15/5.53 % ...remaining for further processing : 1097
% 0.15/5.53 % Other redundant clauses eliminated : 0
% 0.15/5.53 % Clauses deleted for lack of memory : 0
% 0.15/5.53 % Backward-subsumed : 194
% 0.15/5.53 % Backward-rewritten : 288
% 0.15/5.53 % Generated clauses : 2074
% 0.15/5.53 % ...of the previous two non-redundant : 1519
% 0.15/5.53 % ...aggressively subsumed : 0
% 0.15/5.53 % Contextual simplify-reflections : 0
% 0.15/5.53 % Paramodulations : 2074
% 0.15/5.53 % Factorizations : 0
% 0.15/5.53 % NegExts : 0
% 0.15/5.53 % Equation resolutions : 0
% 0.15/5.53 % Disequality decompositions : 0
% 0.15/5.53 % Total rewrite steps : 1595
% 0.15/5.53 % ...of those cached : 1124
% 0.15/5.53 % Propositional unsat checks : 0
% 0.15/5.53 % Propositional check models : 0
% 0.15/5.53 % Propositional check unsatisfiable : 0
% 0.15/5.53 % Propositional clauses : 0
% 0.15/5.53 % Propositional clauses after purity: 0
% 0.15/5.53 % Propositional unsat core size : 0
% 0.15/5.53 % Propositional preprocessing time : 0.000
% 0.15/5.53 % Propositional encoding time : 0.000
% 0.15/5.53 % Propositional solver time : 0.000
% 0.15/5.53 % Success case prop preproc time : 0.000
% 0.15/5.53 % Success case prop encoding time : 0.000
% 0.15/5.53 % Success case prop solver time : 0.000
% 0.15/5.53 % Current number of processed clauses : 615
% 0.15/5.53 % Positive orientable unit clauses : 230
% 0.15/5.53 % Positive unorientable unit clauses: 0
% 0.15/5.53 % Negative unit clauses : 4
% 0.15/5.53 % Non-unit-clauses : 381
% 0.15/5.53 % Current number of unprocessed clauses: 107
% 0.15/5.53 % ...number of literals in the above : 454
% 0.15/5.53 % Current number of archived formulas : 0
% 0.15/5.53 % Current number of archived clauses : 482
% 0.15/5.53 % Clause-clause subsumption calls (NU) : 42460
% 0.15/5.53 % Rec. Clause-clause subsumption calls : 34905
% 0.15/5.53 % Non-unit clause-clause subsumptions : 369
% 0.15/5.53 % Unit Clause-clause subsumption calls : 2796
% 0.15/5.53 % Rewrite failures with RHS unbound : 0
% 0.15/5.53 % BW rewrite match attempts : 647
% 0.15/5.53 % BW rewrite match successes : 252
% 0.15/5.53 % Condensation attempts : 0
% 0.15/5.53 % Condensation successes : 0
% 0.15/5.53 % Termbank termtop insertions : 35422
% 0.15/5.53 % Search garbage collected termcells : 1491
% 0.15/5.53
% 0.15/5.53 % -------------------------------------------------
% 0.15/5.53 % User time : 0.079 s
% 0.15/5.53 % System time : 0.010 s
% 0.15/5.53 % Total time : 0.089 s
% 0.15/5.53 % Maximum resident set size: 4472 pages
% 0.15/5.53
% 0.15/5.53 % -------------------------------------------------
% 0.15/5.53 % User time : 0.084 s
% 0.15/5.53 % System time : 0.011 s
% 0.15/5.53 % Total time : 0.095 s
% 0.15/5.53 % Maximum resident set size: 5120 pages
% 0.15/5.53 % E exiting
%------------------------------------------------------------------------------