%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SYN160-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 : 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:16 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 17 unt; 0 nHn; 41 RR)
% Number of literals : 93 ( 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 : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 76 ( 35 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_137,axiom,
( ~ p1(X2,X3,X1)
| n2(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_137) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_14) ).
cnf(rule_001,axiom,
( ~ n0(X2,X1)
| k1(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_001) ).
cnf(rule_174,axiom,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_174) ).
cnf(axiom_30,axiom,
n0(e,e),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_30) ).
cnf(rule_240,axiom,
( ~ p2(X2,X3,X1)
| n3(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_240) ).
cnf(rule_181,axiom,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_181) ).
cnf(rule_298,axiom,
( ~ p0(X4,X1)
| ~ q3(X2,X3)
| ~ n3(X1)
| r4(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_298) ).
cnf(rule_255,axiom,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_255) ).
cnf(axiom_18,axiom,
p0(c,b),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_18) ).
cnf(rule_314,axiom,
( ~ r4(X1)
| n5(X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_314) ).
cnf(prove_this,negated_conjecture,
~ n5(b,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).
cnf(c_0_13,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_14,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
inference(fof_simplification,[status(thm)],[rule_137]) ).
cnf(c_0_15,plain,
( ~ p0(X2,X1)
| p1(X1,X1,X1) ),
c_0_13 ).
cnf(c_0_16,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_17,plain,
( ~ n0(X2,X1)
| k1(X1) ),
inference(fof_simplification,[status(thm)],[rule_001]) ).
cnf(c_0_18,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_174]) ).
cnf(c_0_19,plain,
( ~ p1(X2,X3,X1)
| n2(X1) ),
c_0_14 ).
cnf(c_0_20,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( ~ n0(X2,X1)
| k1(X1) ),
c_0_17 ).
cnf(c_0_22,axiom,
n0(e,e),
axiom_30 ).
cnf(c_0_23,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
inference(fof_simplification,[status(thm)],[rule_240]) ).
cnf(c_0_24,plain,
( ~ k1(e)
| ~ n2(X1)
| p2(X1,X1,X1) ),
c_0_18 ).
cnf(c_0_25,plain,
n2(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
k1(e),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_28,plain,
( ~ p0(X4,X1)
| ~ q3(X2,X3)
| ~ n3(X1)
| r4(X1) ),
inference(fof_simplification,[status(thm)],[rule_298]) ).
cnf(c_0_29,plain,
( ~ p2(X2,X3,X1)
| n3(X1) ),
c_0_23 ).
cnf(c_0_30,plain,
p2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
inference(fof_simplification,[status(thm)],[rule_255]) ).
cnf(c_0_32,plain,
( ~ p1(X1,X1,X1)
| q2(X1,X1,X1) ),
c_0_27 ).
cnf(c_0_33,plain,
( ~ p0(X4,X1)
| ~ q3(X2,X3)
| ~ n3(X1)
| r4(X1) ),
c_0_28 ).
cnf(c_0_34,plain,
n3(X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
( ~ n0(X3,X1)
| ~ q2(X3,X1,X2)
| q3(X1,X2) ),
c_0_31 ).
cnf(c_0_36,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_20])]) ).
cnf(c_0_37,plain,
( ~ p0(X4,X1)
| ~ q3(X2,X3)
| r4(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]) ).
cnf(c_0_38,plain,
( ~ n0(X1,X1)
| q3(X1,X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,plain,
( ~ n0(X3,X3)
| ~ p0(X2,X1)
| r4(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,axiom,
p0(c,b),
axiom_18 ).
cnf(c_0_41,plain,
( ~ r4(X1)
| n5(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_314]) ).
cnf(c_0_42,plain,
( ~ n0(X1,X1)
| r4(b) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
~ n5(b,b),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_44,plain,
( ~ r4(X1)
| n5(X1,X1) ),
c_0_41 ).
cnf(c_0_45,plain,
r4(b),
inference(spm,[status(thm)],[c_0_42,c_0_22]) ).
cnf(c_0_46,negated_conjecture,
~ n5(b,b),
c_0_43 ).
cnf(c_0_47,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYN160-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/0.38 % Computer : n026.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 10:47:37 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.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.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % sh5l with pid 2069636 completed with status 0
% 0.10/0.47 % Result found by sh5l
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % SubtermCWHack with pid 2069644 completed with status 0
% 0.10/0.47 % Result found by SubtermCWHack
% 0.10/0.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.10/0.47 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.10/0.47 % Search class: FHUNM-FSLM00-SFFFFFNN
% 0.10/0.47 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.47 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.47 % Preprocessing time : 0.004 s
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Unsatisfiable
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 369
% 0.10/0.47 % Removed by relevancy pruning/SinE : 0
% 0.10/0.47 % Initial clauses : 369
% 0.10/0.47 % Removed in clause preprocessing : 7
% 0.10/0.47 % Initial clauses in saturation : 362
% 0.10/0.47 % Processed clauses : 454
% 0.10/0.47 % ...of these trivial : 62
% 0.10/0.47 % ...subsumed : 5
% 0.10/0.47 % ...remaining for further processing : 387
% 0.10/0.47 % Other redundant clauses eliminated : 0
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 26
% 0.10/0.47 % Backward-rewritten : 144
% 0.10/0.47 % Generated clauses : 370
% 0.10/0.47 % ...of the previous two non-redundant : 260
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 0
% 0.10/0.47 % Paramodulations : 370
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 0
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 402
% 0.10/0.47 % ...of those cached : 207
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 217
% 0.10/0.47 % Positive orientable unit clauses : 116
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 1
% 0.10/0.47 % Non-unit-clauses : 100
% 0.10/0.47 % Current number of unprocessed clauses: 143
% 0.10/0.47 % ...number of literals in the above : 527
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 170
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 4341
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 3761
% 0.10/0.47 % Non-unit clause-clause subsumptions : 24
% 0.10/0.47 % Unit Clause-clause subsumption calls : 840
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 182
% 0.10/0.47 % BW rewrite match successes : 123
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 15834
% 0.10/0.47 % Search garbage collected termcells : 1461
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.028 s
% 0.10/0.47 % System time : 0.003 s
% 0.10/0.47 % Total time : 0.032 s
% 0.10/0.47 % Maximum resident set size: 4420 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.034 s
% 0.10/0.47 % System time : 0.009 s
% 0.10/0.47 % Total time : 0.043 s
% 0.10/0.47 % Maximum resident set size: 5120 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------