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

% Computer : n024.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 : Tue Jul 19 18:58:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ iext(uri_ex_p,X1,X2)
    | ~ iext(uri_ex_q,X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bwj7i9tg/lgb.p',i_0_1) ).

cnf(i_0_3,plain,
    iext(uri_ex_p,uri_ex_s,esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bwj7i9tg/lgb.p',i_0_3) ).

cnf(i_0_2,plain,
    iext(uri_ex_q,esk1_0,uri_ex_s),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-bwj7i9tg/lgb.p',i_0_2) ).

cnf(c_0_7,negated_conjecture,
    ( ~ iext(uri_ex_p,X1,X2)
    | ~ iext(uri_ex_q,X2,X1) ),
    i_0_1 ).

cnf(c_0_8,plain,
    iext(uri_ex_p,uri_ex_s,esk1_0),
    i_0_3 ).

cnf(c_0_9,plain,
    iext(uri_ex_q,esk1_0,uri_ex_s),
    i_0_2 ).

cnf(c_0_10,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWB002+2 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun  1 11:41:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.31/2.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/2.37  # No SInE strategy applied
% 7.31/2.37  # Trying AutoSched0 for 150 seconds
% 7.31/2.37  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0e
% 7.31/2.37  # and selection function SelectLargestNegLit.
% 7.31/2.37  #
% 7.31/2.37  # Preprocessing time       : 0.023 s
% 7.31/2.37  
% 7.31/2.37  # Proof found!
% 7.31/2.37  # SZS status Theorem
% 7.31/2.37  # SZS output start CNFRefutation
% See solution above
% 7.31/2.37  # Training examples: 0 positive, 0 negative
% 7.31/2.37  
% 7.31/2.37  # -------------------------------------------------
% 7.31/2.37  # User time                : 0.022 s
% 7.31/2.37  # System time              : 0.007 s
% 7.31/2.37  # Total time               : 0.029 s
% 7.31/2.37  # Maximum resident set size: 7128 pages
% 7.31/2.37  
%------------------------------------------------------------------------------