%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYN155-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 : n020.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:32:39 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.67s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 18
% Syntax : Number of clauses : 63 ( 25 unt; 0 nHn; 56 RR)
% Number of literals : 120 ( 0 equ; 63 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 16 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 84 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_085) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_159,axiom,
( ~ k1(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_159) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_236,axiom,
( ~ n2(X1)
| m3(X1,X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_236) ).
cnf(rule_240,axiom,
( ~ p2(X2,X3,X1)
| n3(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(rule_284,axiom,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_284) ).
cnf(rule_274,axiom,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_274) ).
cnf(axiom_34,axiom,
n0(c,d),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(rule_186,axiom,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_186) ).
cnf(prove_this,negated_conjecture,
~ n4(X1,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(rule_003,axiom,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_003) ).
cnf(axiom_27,axiom,
m0(e,b,c),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_27) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
cnf(axiom_13,axiom,
r0(e),
file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_13) ).
cnf(c_0_18,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_19,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_20,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_21,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_18 ).
cnf(c_0_22,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_23,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_159]) ).
cnf(c_0_24,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_19 ).
cnf(c_0_25,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_26,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_236]) ).
cnf(c_0_27,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_20 ).
cnf(c_0_28,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_30,plain,
( ~ k1(X1)
| p2(X1,X1,X1) ),
c_0_23 ).
cnf(c_0_31,plain,
k1(e),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_284]) ).
cnf(c_0_33,plain,
( ~ n2(X1)
| m3(X1,X1,X1) ),
c_0_26 ).
cnf(c_0_34,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
inference(fof_simplification,[status(thm)],[rule_274]) ).
cnf(c_0_36,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
c_0_29 ).
cnf(c_0_37,plain,
p2(e,e,e),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( ~ m3(X1,X1,X1)
| ~ k4(X2)
| n4(X1,X1) ),
c_0_32 ).
cnf(c_0_39,plain,
m3(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_40,plain,
( ~ n3(e)
| ~ q3(e,b)
| ~ n0(c,d)
| k4(c) ),
c_0_35 ).
cnf(c_0_41,plain,
n3(e),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,axiom,
n0(c,d),
axiom_34 ).
cnf(c_0_43,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_44,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_186]) ).
cnf(c_0_45,negated_conjecture,
~ n4(X1,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_46,plain,
( ~ k4(X2)
| n4(X1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_47,plain,
( ~ q3(e,b)
| k4(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_42])]) ).
cnf(c_0_48,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ l1(X2,X1)
| q2(X1,X1,X2) ),
c_0_44 ).
cnf(c_0_50,negated_conjecture,
~ n4(X1,a),
c_0_45 ).
cnf(c_0_51,plain,
( ~ q3(e,b)
| n4(X1,X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( ~ n0(X1,X1)
| ~ l1(X2,X1)
| q3(X1,X2) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_003]) ).
cnf(c_0_54,negated_conjecture,
~ q3(e,b),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_55,plain,
( ~ l1(X1,e)
| q3(e,X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_56,plain,
( ~ m0(X2,X1,X3)
| ~ r0(X4)
| ~ p0(X3,X1)
| l1(X1,X2) ),
c_0_53 ).
cnf(c_0_57,axiom,
m0(e,b,c),
axiom_27 ).
cnf(c_0_58,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_59,negated_conjecture,
~ l1(b,e),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,axiom,
r0(e),
axiom_13 ).
cnf(c_0_61,plain,
~ r0(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]),c_0_59]) ).
cnf(c_0_62,plain,
$false,
inference(sr,[status(thm)],[c_0_60,c_0_61]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN155-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.56 % Computer : n020.cluster.edu
% 0.09/0.56 % Model : x86_64 x86_64
% 0.09/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56 % Memory : 8046.5625MB
% 0.09/0.56 % OS : Linux 6.8.0-71-generic
% 0.09/0.57 % CPULimit : 300
% 0.09/0.57 % WCLimit : 300
% 0.09/0.57 % DateTime : Mon Sep 21 10:45:48 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.61 Running first-order theorem proving
% 0.13/0.61 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.13/0.67 % Version: 3.5.1
% 0.13/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.67 % Starting sh5l with 300s (1) cores
% 0.13/0.67 % sh5l with pid 2724623 completed with status 0
% 0.13/0.67 % Result found by sh5l
% 0.13/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.67 % Starting sh5l with 300s (1) cores
% 0.13/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.67 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.67 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.67 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.67 % SubtermCWHack with pid 2724624 completed with status 0
% 0.13/0.67 % Result found by SubtermCWHack
% 0.13/0.67 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.13/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.67 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.13/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.67 % Starting sh5l with 300s (1) cores
% 0.13/0.67 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.13/0.67 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.13/0.67 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.13/0.67 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.67 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.67 % Preprocessing time : 0.005 s
% 0.13/0.67
% 0.13/0.67 % Proof found!
% 0.13/0.67 % SZS status Unsatisfiable
% 0.13/0.67 % SZS output start CNFRefutation
% See solution above
% 0.13/0.67 % Parsed axioms : 369
% 0.13/0.67 % Removed by relevancy pruning/SinE : 0
% 0.13/0.67 % Initial clauses : 369
% 0.13/0.67 % Removed in clause preprocessing : 7
% 0.13/0.67 % Initial clauses in saturation : 362
% 0.13/0.67 % Processed clauses : 584
% 0.13/0.67 % ...of these trivial : 81
% 0.13/0.67 % ...subsumed : 8
% 0.13/0.67 % ...remaining for further processing : 495
% 0.13/0.67 % Other redundant clauses eliminated : 0
% 0.13/0.67 % Clauses deleted for lack of memory : 0
% 0.13/0.67 % Backward-subsumed : 57
% 0.13/0.67 % Backward-rewritten : 174
% 0.13/0.67 % Generated clauses : 541
% 0.13/0.67 % ...of the previous two non-redundant : 382
% 0.13/0.67 % ...aggressively subsumed : 0
% 0.13/0.67 % Contextual simplify-reflections : 0
% 0.13/0.67 % Paramodulations : 539
% 0.13/0.67 % Factorizations : 0
% 0.13/0.67 % NegExts : 0
% 0.13/0.67 % Equation resolutions : 0
% 0.13/0.67 % Disequality decompositions : 0
% 0.13/0.67 % Total rewrite steps : 555
% 0.13/0.67 % ...of those cached : 317
% 0.13/0.67 % Propositional unsat checks : 0
% 0.13/0.67 % Propositional check models : 0
% 0.13/0.67 % Propositional check unsatisfiable : 0
% 0.13/0.67 % Propositional clauses : 0
% 0.13/0.67 % Propositional clauses after purity: 0
% 0.13/0.67 % Propositional unsat core size : 0
% 0.13/0.67 % Propositional preprocessing time : 0.000
% 0.13/0.67 % Propositional encoding time : 0.000
% 0.13/0.67 % Propositional solver time : 0.000
% 0.13/0.67 % Success case prop preproc time : 0.000
% 0.13/0.67 % Success case prop encoding time : 0.000
% 0.13/0.67 % Success case prop solver time : 0.000
% 0.13/0.67 % Current number of processed clauses : 262
% 0.13/0.67 % Positive orientable unit clauses : 149
% 0.13/0.67 % Positive unorientable unit clauses: 0
% 0.13/0.67 % Negative unit clauses : 4
% 0.13/0.67 % Non-unit-clauses : 109
% 0.13/0.67 % Current number of unprocessed clauses: 113
% 0.13/0.67 % ...number of literals in the above : 424
% 0.13/0.67 % Current number of archived formulas : 0
% 0.13/0.67 % Current number of archived clauses : 233
% 0.13/0.67 % Clause-clause subsumption calls (NU) : 6768
% 0.13/0.67 % Rec. Clause-clause subsumption calls : 5911
% 0.13/0.67 % Non-unit clause-clause subsumptions : 30
% 0.13/0.67 % Unit Clause-clause subsumption calls : 1221
% 0.13/0.67 % Rewrite failures with RHS unbound : 0
% 0.13/0.67 % BW rewrite match attempts : 216
% 0.13/0.67 % BW rewrite match successes : 145
% 0.13/0.67 % Condensation attempts : 0
% 0.13/0.67 % Condensation successes : 0
% 0.13/0.67 % Termbank termtop insertions : 17774
% 0.13/0.67 % Search garbage collected termcells : 1461
% 0.13/0.67
% 0.13/0.67 % -------------------------------------------------
% 0.13/0.67 % User time : 0.033 s
% 0.13/0.67 % System time : 0.004 s
% 0.13/0.67 % Total time : 0.037 s
% 0.13/0.67 % Maximum resident set size: 4472 pages
% 0.13/0.67
% 0.13/0.67 % -------------------------------------------------
% 0.13/0.67 % User time : 0.041 s
% 0.13/0.67 % System time : 0.008 s
% 0.13/0.67 % Total time : 0.049 s
% 0.13/0.67 % Maximum resident set size: 5120 pages
% 0.13/0.67 % E exiting
%------------------------------------------------------------------------------