## TSTP Solution File: SYN969+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n027.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  : 600s
% DateTime : Thu Jul 21 04:58:31 EDT 2022

% Result   : Theorem 7.58s 2.27s
% Output   : CNFRefutation 7.58s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   10 (   5 unt;   0 nHn;  10 RR)
%            Number of literals    :   15 (   0 equ;   7 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    5 (   0 sgn)

%------------------------------------------------------------------------------
cnf(i_0_4,negated_conjecture,
( q(X1)
| ~ p(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2juwrl9s/input.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
( p(X1)
| ~ r(X1) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2juwrl9s/input.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
~ q(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2juwrl9s/input.p',i_0_1) ).

cnf(i_0_3,negated_conjecture,
r(esk1_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2juwrl9s/input.p',i_0_3) ).

cnf(c_0_9,negated_conjecture,
( q(X1)
| ~ p(X1) ),
i_0_4 ).

cnf(c_0_10,negated_conjecture,
( p(X1)
| ~ r(X1) ),
i_0_2 ).

cnf(c_0_11,negated_conjecture,
~ q(esk1_0),
i_0_1 ).

cnf(c_0_12,negated_conjecture,
( q(X1)
| ~ r(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
r(esk1_0),
i_0_3 ).

cnf(c_0_14,negated_conjecture,
\$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
[proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN969+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 13:03:51 EDT 2022
% 0.13/0.34  % CPUTime  :
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.58/2.27  # ENIGMATIC: Solved by autoschedule:
% 7.58/2.27  # No SInE strategy applied
% 7.58/2.27  # Trying AutoSched0 for 150 seconds
% 7.58/2.27  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 7.58/2.27  # and selection function PSelectComplexExceptRRHorn.
% 7.58/2.27  #
% 7.58/2.27  # Preprocessing time       : 0.023 s
% 7.58/2.27
% 7.58/2.27  # Proof found!
% 7.58/2.27  # SZS status Theorem
% 7.58/2.27  # SZS output start CNFRefutation
% See solution above
% 7.58/2.27  # Training examples: 0 positive, 0 negative
% 7.58/2.27
% 7.58/2.27  # -------------------------------------------------
% 7.58/2.27  # User time                : 0.023 s
% 7.58/2.27  # System time              : 0.007 s
% 7.58/2.27  # Total time               : 0.030 s
% 7.58/2.27  # Maximum resident set size: 7120 pages
% 7.58/2.27
%------------------------------------------------------------------------------