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

% Computer : n008.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:51:37 EDT 2022

% Result   : Theorem 8.48s 2.43s
% Output   : CNFRefutation 8.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   16 (   8 unt;   0 nHn;  16 RR)
%            Number of literals    :   24 (   0 equ;  11 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   12 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( big_q(X1,X2)
    | ~ big_r(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aaw2zftp/input.p',i_0_3) ).

cnf(i_0_5,negated_conjecture,
    big_r(a,b),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aaw2zftp/input.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    ( big_r(X1,X2)
    | ~ big_r(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aaw2zftp/input.p',i_0_4) ).

cnf(i_0_2,negated_conjecture,
    ( big_q(X1,X1)
    | ~ big_q(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aaw2zftp/input.p',i_0_2) ).

cnf(i_0_1,negated_conjecture,
    ( ~ big_q(a,a)
    | ~ big_q(b,b) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-aaw2zftp/input.p',i_0_1) ).

cnf(c_0_11,negated_conjecture,
    ( big_q(X1,X2)
    | ~ big_r(X1,X2) ),
    i_0_3 ).

cnf(c_0_12,negated_conjecture,
    big_r(a,b),
    i_0_5 ).

cnf(c_0_13,negated_conjecture,
    ( big_r(X1,X2)
    | ~ big_r(X2,X1) ),
    i_0_4 ).

cnf(c_0_14,negated_conjecture,
    ( big_q(X1,X1)
    | ~ big_q(X1,X2) ),
    i_0_2 ).

cnf(c_0_15,negated_conjecture,
    big_q(a,b),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    big_r(b,a),
    inference(spm,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ big_q(a,a)
    | ~ big_q(b,b) ),
    i_0_1 ).

cnf(c_0_18,negated_conjecture,
    big_q(a,a),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    big_q(b,a),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ~ big_q(b,b),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_19]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SYN356+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Tue Jul 12 03:15:10 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 8.48/2.43  # ENIGMATIC: Solved by autoschedule:
% 8.48/2.43  # No SInE strategy applied
% 8.48/2.43  # Trying AutoSched0 for 150 seconds
% 8.48/2.43  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 8.48/2.43  # and selection function SelectNewComplexAHP.
% 8.48/2.43  #
% 8.48/2.43  # Preprocessing time       : 0.012 s
% 8.48/2.43  
% 8.48/2.43  # Proof found!
% 8.48/2.43  # SZS status Theorem
% 8.48/2.43  # SZS output start CNFRefutation
% See solution above
% 8.48/2.43  # Training examples: 0 positive, 0 negative
% 8.48/2.43  
% 8.48/2.43  # -------------------------------------------------
% 8.48/2.43  # User time                : 0.014 s
% 8.48/2.43  # System time              : 0.004 s
% 8.48/2.43  # Total time               : 0.018 s
% 8.48/2.43  # Maximum resident set size: 7116 pages
% 8.48/2.43  
%------------------------------------------------------------------------------