TSTP Solution File: SEU149+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n020.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 08:38:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wz05f72n/input.p',i_0_6) ).

cnf(i_0_11,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wz05f72n/input.p',i_0_11) ).

cnf(i_0_16,negated_conjecture,
    unordered_pair(esk6_0,esk7_0) = singleton(esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wz05f72n/input.p',i_0_16) ).

cnf(i_0_15,negated_conjecture,
    esk6_0 != esk5_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-wz05f72n/input.p',i_0_15) ).

cnf(c_0_21,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_6 ).

cnf(c_0_22,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_11 ).

cnf(c_0_23,plain,
    ( X1 = X2
    | ~ in(X1,singleton(X2)) ),
    inference(er,[status(thm)],[c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    unordered_pair(esk6_0,esk7_0) = singleton(esk5_0),
    i_0_16 ).

cnf(c_0_25,plain,
    ( in(X1,X2)
    | X2 != unordered_pair(X1,X3) ),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_26,negated_conjecture,
    ( X1 = esk5_0
    | ~ in(X1,unordered_pair(esk6_0,esk7_0)) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,plain,
    in(X1,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[c_0_25]) ).

cnf(c_0_28,negated_conjecture,
    esk6_0 != esk5_0,
    i_0_15 ).

cnf(c_0_29,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU149+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 : Mon Jun 20 07:08:35 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.29/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.29/2.35  # No SInE strategy applied
% 7.29/2.35  # Trying AutoSched0 for 150 seconds
% 7.29/2.35  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.29/2.35  # and selection function SelectNewComplexAHP.
% 7.29/2.35  #
% 7.29/2.35  # Preprocessing time       : 0.024 s
% 7.29/2.35  
% 7.29/2.35  # Proof found!
% 7.29/2.35  # SZS status Theorem
% 7.29/2.35  # SZS output start CNFRefutation
% See solution above
% 7.29/2.35  # Training examples: 0 positive, 0 negative
% 7.29/2.35  
% 7.29/2.35  # -------------------------------------------------
% 7.29/2.35  # User time                : 0.026 s
% 7.29/2.35  # System time              : 0.005 s
% 7.29/2.35  # Total time               : 0.030 s
% 7.29/2.35  # Maximum resident set size: 7120 pages
% 7.29/2.35  
%------------------------------------------------------------------------------