%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN110-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 : n005.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:09 PM UTC 2026
% Result : Unsatisfiable 0.47s 0.63s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 51 ( 25 unt; 0 nHn; 41 RR)
% Number of literals : 94 ( 0 equ; 47 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 76 ( 33 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_024,axiom,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_024) ).
cnf(rule_014,axiom,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_014) ).
cnf(axiom_12,axiom,
m0(a,X1,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_12) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_19) ).
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(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_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
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_33,axiom,
q0(d,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_33) ).
cnf(prove_this,negated_conjecture,
~ k2(c,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
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(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).
cnf(c_0_15,plain,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
inference(fof_simplification,[status(thm)],[rule_024]) ).
cnf(c_0_16,plain,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_014]) ).
cnf(c_0_17,plain,
( ~ m1(X2,c,X2)
| ~ q0(X1,X2)
| ~ m0(a,X3,a)
| m1(X1,a,X2) ),
c_0_15 ).
cnf(c_0_18,axiom,
m0(a,X1,a),
axiom_12 ).
cnf(c_0_19,plain,
( ~ m0(X2,X3,X1)
| m1(X1,X1,X1) ),
c_0_16 ).
cnf(c_0_20,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_21,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_029]) ).
cnf(c_0_22,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_110]) ).
cnf(c_0_23,plain,
( ~ q0(X1,X2)
| ~ m1(X2,c,X2)
| m1(X1,a,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_24,plain,
m1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_127]) ).
cnf(c_0_26,plain,
( ~ s0(X1)
| ~ p0(X1,X2)
| m1(X1,X2,X1) ),
c_0_21 ).
cnf(c_0_27,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_28,axiom,
s0(b),
axiom_5 ).
cnf(c_0_29,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_129]) ).
cnf(c_0_30,plain,
( ~ m0(X2,X3,X1)
| q1(X1,X1,X1) ),
c_0_22 ).
cnf(c_0_31,plain,
( ~ q0(X1,c)
| m1(X1,a,c) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,axiom,
q0(d,c),
axiom_33 ).
cnf(c_0_33,negated_conjecture,
~ k2(c,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_34,plain,
( ~ k2(X4,X2)
| ~ k1(X4)
| ~ m1(X3,X2,X1)
| k2(X1,X2) ),
c_0_25 ).
cnf(c_0_35,plain,
m1(b,X1,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_36,plain,
( ~ q1(X2,X1,X1)
| k2(X1,X1) ),
c_0_29 ).
cnf(c_0_37,plain,
q1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_38,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_39,plain,
m1(d,a,c),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_40,negated_conjecture,
~ k2(c,a),
c_0_33 ).
cnf(c_0_41,plain,
( ~ k1(X2)
| ~ k2(X2,X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
k2(X1,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_38 ).
cnf(c_0_44,axiom,
n0(a,b),
axiom_15 ).
cnf(c_0_45,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_46,plain,
( ~ k1(X1)
| ~ k2(X1,a) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_39]),c_0_40]) ).
cnf(c_0_47,plain,
( ~ k1(X1)
| k2(b,X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
k1(b),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,plain,
k1(a),
inference(spm,[status(thm)],[c_0_43,c_0_45]) ).
cnf(c_0_50,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SYN110-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.45 % Computer : n005.cluster.edu
% 0.17/0.45 % Model : x86_64 x86_64
% 0.17/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.45 % Memory : 8046.5625MB
% 0.17/0.45 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 10:43:33 UTC 2026
% 0.17/0.46 % CPUTime :
% 0.17/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.52 Running first-order theorem proving
% 0.22/0.52 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.47/0.63 % Version: 3.5.1
% 0.47/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.47/0.63 % Starting sh5l with 300s (1) cores
% 0.47/0.63 % new_bool_3 with pid 3260184 completed with status 0
% 0.47/0.63 % Result found by new_bool_3
% 0.47/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.63 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.47/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.47/0.63 % SubtermCWHack with pid 3260192 completed with status 0
% 0.47/0.63 % Result found by SubtermCWHack
% 0.47/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.47/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.47/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.47/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.47/0.63 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.47/0.63 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.47/0.63 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.47/0.63 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.47/0.63 % Starting SubtermCWHack with 31s (1) cores
% 0.47/0.63 % Preprocessing time : 0.003 s
% 0.47/0.63
% 0.47/0.63 % Proof found!
% 0.47/0.63 % SZS status Unsatisfiable
% 0.47/0.63 % SZS output start CNFRefutation
% See solution above
% 0.47/0.63 % Parsed axioms : 369
% 0.47/0.63 % Removed by relevancy pruning/SinE : 41
% 0.47/0.63 % Initial clauses : 328
% 0.47/0.63 % Removed in clause preprocessing : 5
% 0.47/0.63 % Initial clauses in saturation : 323
% 0.47/0.63 % Processed clauses : 1157
% 0.47/0.63 % ...of these trivial : 136
% 0.47/0.63 % ...subsumed : 145
% 0.47/0.63 % ...remaining for further processing : 876
% 0.47/0.63 % Other redundant clauses eliminated : 0
% 0.47/0.63 % Clauses deleted for lack of memory : 0
% 0.47/0.63 % Backward-subsumed : 93
% 0.47/0.63 % Backward-rewritten : 226
% 0.47/0.63 % Generated clauses : 1544
% 0.47/0.63 % ...of the previous two non-redundant : 1169
% 0.47/0.63 % ...aggressively subsumed : 0
% 0.47/0.63 % Contextual simplify-reflections : 1
% 0.47/0.63 % Paramodulations : 1544
% 0.47/0.63 % Factorizations : 0
% 0.47/0.63 % NegExts : 0
% 0.47/0.63 % Equation resolutions : 0
% 0.47/0.63 % Disequality decompositions : 0
% 0.47/0.63 % Total rewrite steps : 1126
% 0.47/0.63 % ...of those cached : 757
% 0.47/0.63 % Propositional unsat checks : 0
% 0.47/0.63 % Propositional check models : 0
% 0.47/0.63 % Propositional check unsatisfiable : 0
% 0.47/0.63 % Propositional clauses : 0
% 0.47/0.63 % Propositional clauses after purity: 0
% 0.47/0.63 % Propositional unsat core size : 0
% 0.47/0.63 % Propositional preprocessing time : 0.000
% 0.47/0.63 % Propositional encoding time : 0.000
% 0.47/0.63 % Propositional solver time : 0.000
% 0.47/0.63 % Success case prop preproc time : 0.000
% 0.47/0.63 % Success case prop encoding time : 0.000
% 0.47/0.63 % Success case prop solver time : 0.000
% 0.47/0.63 % Current number of processed clauses : 557
% 0.47/0.63 % Positive orientable unit clauses : 207
% 0.47/0.63 % Positive unorientable unit clauses: 0
% 0.47/0.63 % Negative unit clauses : 1
% 0.47/0.63 % Non-unit-clauses : 349
% 0.47/0.63 % Current number of unprocessed clauses: 208
% 0.47/0.63 % ...number of literals in the above : 765
% 0.47/0.63 % Current number of archived formulas : 0
% 0.47/0.63 % Current number of archived clauses : 319
% 0.47/0.63 % Clause-clause subsumption calls (NU) : 26007
% 0.47/0.63 % Rec. Clause-clause subsumption calls : 21318
% 0.47/0.63 % Non-unit clause-clause subsumptions : 219
% 0.47/0.63 % Unit Clause-clause subsumption calls : 1769
% 0.47/0.63 % Rewrite failures with RHS unbound : 0
% 0.47/0.63 % BW rewrite match attempts : 562
% 0.47/0.63 % BW rewrite match successes : 199
% 0.47/0.63 % Condensation attempts : 0
% 0.47/0.63 % Condensation successes : 0
% 0.47/0.63 % Termbank termtop insertions : 28196
% 0.47/0.63 % Search garbage collected termcells : 1514
% 0.47/0.63
% 0.47/0.63 % -------------------------------------------------
% 0.47/0.63 % User time : 0.060 s
% 0.47/0.63 % System time : 0.001 s
% 0.47/0.63 % Total time : 0.061 s
% 0.47/0.63 % Maximum resident set size: 4472 pages
% 0.47/0.63
% 0.47/0.63 % -------------------------------------------------
% 0.47/0.63 % User time : 0.066 s
% 0.47/0.63 % System time : 0.005 s
% 0.47/0.63 % Total time : 0.071 s
% 0.47/0.63 % Maximum resident set size: 4864 pages
% 0.47/0.63 % E exiting
%------------------------------------------------------------------------------