## TSTP Solution File: SYN259-1 by E---3.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : E---3.0
% Problem  : SYN259-1 : TPTP v8.1.0. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 29 21:38:48 EDT 2022

% Result   : Unsatisfiable 0.20s 0.49s
% Output   : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   56
% Syntax   : Number of formulae    :   60 (   5 unt;  53 typ;   0 def)
%            Number of atoms       :    9 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :    6 (   4   ~;   2   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   90 (  48   >;  42   *;   0   +;   0  <<)
%            Number of predicates  :   49 (  48 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    8 (   4 sgn   0   !;   0   ?;   0   :)

%------------------------------------------------------------------------------
tff(decl_22,type,
d: \$i ).

tff(decl_23,type,
s0: \$i > \$o ).

tff(decl_24,type,
e: \$i ).

tff(decl_25,type,
q0: ( \$i * \$i ) > \$o ).

tff(decl_26,type,
n0: ( \$i * \$i ) > \$o ).

tff(decl_27,type,
a: \$i ).

tff(decl_28,type,
m0: ( \$i * \$i * \$i ) > \$o ).

tff(decl_29,type,
b: \$i ).

tff(decl_30,type,
r0: \$i > \$o ).

tff(decl_31,type,
p0: ( \$i * \$i ) > \$o ).

tff(decl_32,type,
c: \$i ).

tff(decl_33,type,
l0: \$i > \$o ).

tff(decl_34,type,
k0: \$i > \$o ).

tff(decl_35,type,
k1: \$i > \$o ).

tff(decl_36,type,
l1: ( \$i * \$i ) > \$o ).

tff(decl_37,type,
m1: ( \$i * \$i * \$i ) > \$o ).

tff(decl_38,type,
n1: ( \$i * \$i * \$i ) > \$o ).

tff(decl_39,type,
p1: ( \$i * \$i * \$i ) > \$o ).

tff(decl_40,type,
q1: ( \$i * \$i * \$i ) > \$o ).

tff(decl_41,type,
r1: \$i > \$o ).

tff(decl_42,type,
s1: \$i > \$o ).

tff(decl_43,type,
k2: ( \$i * \$i ) > \$o ).

tff(decl_44,type,
l2: ( \$i * \$i ) > \$o ).

tff(decl_45,type,
m2: \$i > \$o ).

tff(decl_46,type,
n2: \$i > \$o ).

tff(decl_47,type,
p2: ( \$i * \$i * \$i ) > \$o ).

tff(decl_48,type,
q2: ( \$i * \$i * \$i ) > \$o ).

tff(decl_49,type,
r2: \$i > \$o ).

tff(decl_50,type,
s2: \$i > \$o ).

tff(decl_51,type,
k3: ( \$i * \$i * \$i ) > \$o ).

tff(decl_52,type,
l3: ( \$i * \$i ) > \$o ).

tff(decl_53,type,
m3: ( \$i * \$i * \$i ) > \$o ).

tff(decl_54,type,
n3: \$i > \$o ).

tff(decl_55,type,
p3: ( \$i * \$i * \$i ) > \$o ).

tff(decl_56,type,
q3: ( \$i * \$i ) > \$o ).

tff(decl_57,type,
r3: ( \$i * \$i * \$i ) > \$o ).

tff(decl_58,type,
s3: ( \$i * \$i ) > \$o ).

tff(decl_59,type,
k4: \$i > \$o ).

tff(decl_60,type,
l4: \$i > \$o ).

tff(decl_61,type,
m4: ( \$i * \$i ) > \$o ).

tff(decl_62,type,
n4: ( \$i * \$i ) > \$o ).

tff(decl_63,type,
p4: ( \$i * \$i * \$i ) > \$o ).

tff(decl_64,type,
q4: ( \$i * \$i ) > \$o ).

tff(decl_65,type,
r4: \$i > \$o ).

tff(decl_66,type,
s4: \$i > \$o ).

tff(decl_67,type,
k5: \$i > \$o ).

tff(decl_68,type,
l5: \$i > \$o ).

tff(decl_69,type,
m5: ( \$i * \$i ) > \$o ).

tff(decl_70,type,
n5: ( \$i * \$i ) > \$o ).

tff(decl_71,type,
p5: ( \$i * \$i * \$i ) > \$o ).

tff(decl_72,type,
q5: ( \$i * \$i ) > \$o ).

tff(decl_73,type,
r5: ( \$i * \$i ) > \$o ).

tff(decl_74,type,
s5: \$i > \$o ).

cnf(rule_067,axiom,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',rule_067) ).

cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox/benchmark/Axioms/SYN001-0.ax',axiom_17) ).

cnf(prove_this,negated_conjecture,
~ p1(X1,d,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

cnf(c_0_3,axiom,
( p1(X1,X1,X1)
| ~ q0(X2,X1) ),
rule_067 ).

cnf(c_0_4,axiom,
q0(X1,d),
axiom_17 ).

cnf(c_0_5,negated_conjecture,
~ p1(X1,d,X1),
prove_this ).

cnf(c_0_6,plain,
\$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : SYN259-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/0.13  % Command    : run_E %s %d THM
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Mon Sep  5 02:27:16 EDT 2022
% 0.12/0.34  % CPUTime    :
% 0.20/0.46  Running first-order on 8 cores theorem proving
% 0.20/0.46  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.20/0.46  # Version: 3.0pre003
% 0.20/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49  # Starting sh5l with 300s (1) cores
% 0.20/0.49  # new_bool_3 with pid 15693 completed with status 0
% 0.20/0.49  # Result found by new_bool_3
% 0.20/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49  # ...ProofStateSinE()=209/369
% 0.20/0.49  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49  # SAT001_MinMin_p005000_rr_RG with pid 15698 completed with status 0
% 0.20/0.49  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.20/0.49  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49  # ...ProofStateSinE()=209/369
% 0.20/0.49  # Search class: FHUNM-FSLM00-SFFFFFNN
% 0.20/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.20/0.49  # Preprocessing time       : 0.003 s
% 0.20/0.49  # Presaturation interreduction done
% 0.20/0.49
% 0.20/0.49  # Proof found!
% 0.20/0.49  # SZS status Unsatisfiable
% 0.20/0.49  # SZS output start CNFRefutation
% See solution above
% 0.20/0.49  # Parsed axioms                        : 369
% 0.20/0.49  # Removed by relevancy pruning/SinE    : 160
% 0.20/0.49  # Initial clauses                      : 209
% 0.20/0.49  # Removed in clause preprocessing      : 5
% 0.20/0.49  # Initial clauses in saturation        : 204
% 0.20/0.49  # Processed clauses                    : 284
% 0.20/0.49  # ...of these trivial                  : 9
% 0.20/0.49  # ...subsumed                          : 14
% 0.20/0.49  # ...remaining for further processing  : 261
% 0.20/0.49  # Other redundant clauses eliminated   : 0
% 0.20/0.49  # Clauses deleted for lack of memory   : 0
% 0.20/0.49  # Backward-subsumed                    : 3
% 0.20/0.49  # Backward-rewritten                   : 6
% 0.20/0.49  # Generated clauses                    : 45
% 0.20/0.49  # ...of the previous two non-redundant : 31
% 0.20/0.49  # ...aggressively subsumed             : 0
% 0.20/0.49  # Contextual simplify-reflections      : 1
% 0.20/0.49  # Paramodulations                      : 45
% 0.20/0.49  # Factorizations                       : 0
% 0.20/0.49  # NegExts                              : 0
% 0.20/0.49  # Equation resolutions                 : 0
% 0.20/0.49  # Propositional unsat checks           : 0
% 0.20/0.49  #    Propositional check models        : 0
% 0.20/0.49  #    Propositional check unsatisfiable : 0
% 0.20/0.49  #    Propositional clauses             : 0
% 0.20/0.49  #    Propositional clauses after purity: 0
% 0.20/0.49  #    Propositional unsat core size     : 0
% 0.20/0.49  #    Propositional preprocessing time  : 0.000
% 0.20/0.49  #    Propositional encoding time       : 0.000
% 0.20/0.49  #    Propositional solver time         : 0.000
% 0.20/0.49  #    Success case prop preproc time    : 0.000
% 0.20/0.49  #    Success case prop encoding time   : 0.000
% 0.20/0.49  #    Success case prop solver time     : 0.000
% 0.20/0.49  # Current number of processed clauses  : 75
% 0.20/0.49  #    Positive orientable unit clauses  : 56
% 0.20/0.49  #    Positive unorientable unit clauses: 0
% 0.20/0.49  #    Negative unit clauses             : 1
% 0.20/0.49  #    Non-unit-clauses                  : 18
% 0.20/0.49  # Current number of unprocessed clauses: 127
% 0.20/0.49  # ...number of literals in the above   : 354
% 0.20/0.49  # Current number of archived formulas  : 0
% 0.20/0.49  # Current number of archived clauses   : 186
% 0.20/0.49  # Clause-clause subsumption calls (NU) : 6367
% 0.20/0.49  # Rec. Clause-clause subsumption calls : 4644
% 0.20/0.49  # Non-unit clause-clause subsumptions  : 18
% 0.20/0.49  # Unit Clause-clause subsumption calls : 11
% 0.20/0.49  # Rewrite failures with RHS unbound    : 0
% 0.20/0.49  # BW rewrite match attempts            : 7
% 0.20/0.49  # BW rewrite match successes           : 6
% 0.20/0.49  # Condensation attempts                : 0
% 0.20/0.49  # Condensation successes               : 0
% 0.20/0.49  # Termbank termtop insertions          : 7681
% 0.20/0.49
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.014 s
% 0.20/0.49  # System time              : 0.008 s
% 0.20/0.49  # Total time               : 0.022 s
% 0.20/0.49  # Maximum resident set size: 2288 pages
% 0.20/0.49
% 0.20/0.49  # -------------------------------------------------
% 0.20/0.49  # User time                : 0.021 s
% 0.20/0.49  # System time              : 0.009 s
% 0.20/0.49  # Total time               : 0.030 s
% 0.20/0.49  # Maximum resident set size: 2028 pages
%------------------------------------------------------------------------------
```