TSTP Solution File: SEU151+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU151+1 : TPTP v8.1.0. Released v3.3.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 : Tue Jul 19 08:38:54 EDT 2022

% Result   : Theorem 7.13s 2.29s
% Output   : CNFRefutation 7.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   22 (  11 unt;   4 nHn;  21 RR)
%            Number of literals    :   43 (  29 equ;  21 neg)
%            Maximal clause size   :    4 (   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;   4 con; 0-2 aty)
%            Number of variables   :   37 (   7 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc5gn5rw/input.p',i_0_6) ).

cnf(i_0_12,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc5gn5rw/input.p',i_0_12) ).

cnf(i_0_8,plain,
    ( X1 = X2
    | X1 = X3
    | X4 != unordered_pair(X3,X2)
    | ~ in(X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc5gn5rw/input.p',i_0_8) ).

cnf(i_0_10,negated_conjecture,
    esk2_0 != esk5_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc5gn5rw/input.p',i_0_10) ).

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

cnf(i_0_11,negated_conjecture,
    esk2_0 != esk4_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-jc5gn5rw/input.p',i_0_11) ).

cnf(c_0_19,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X4,X3) ),
    i_0_6 ).

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

cnf(c_0_21,negated_conjecture,
    unordered_pair(esk2_0,esk3_0) = unordered_pair(esk4_0,esk5_0),
    i_0_12 ).

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

cnf(c_0_23,negated_conjecture,
    ( in(esk5_0,X1)
    | X1 != unordered_pair(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

cnf(c_0_25,negated_conjecture,
    in(esk5_0,unordered_pair(esk2_0,esk3_0)),
    inference(er,[status(thm)],[c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    esk2_0 != esk5_0,
    i_0_10 ).

cnf(c_0_27,plain,
    esk3_0 = esk5_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_28,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != unordered_pair(X3,X4) ),
    i_0_7 ).

cnf(c_0_29,negated_conjecture,
    unordered_pair(esk4_0,esk5_0) = unordered_pair(esk2_0,esk5_0),
    inference(rw,[status(thm)],[c_0_21,c_0_27]) ).

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

cnf(c_0_31,plain,
    ( X1 = esk5_0
    | X1 = esk4_0
    | ~ in(X1,unordered_pair(esk2_0,esk5_0)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_29]) ).

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

cnf(c_0_33,negated_conjecture,
    esk2_0 != esk4_0,
    i_0_11 ).

cnf(c_0_34,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU151+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n027.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sat Jun 18 23:45:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.13/2.29  # ENIGMATIC: Solved by autoschedule:
% 7.13/2.29  # No SInE strategy applied
% 7.13/2.29  # Trying AutoSched0 for 150 seconds
% 7.13/2.29  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.13/2.29  # and selection function SelectNewComplexAHP.
% 7.13/2.29  #
% 7.13/2.29  # Preprocessing time       : 0.013 s
% 7.13/2.29  
% 7.13/2.29  # Proof found!
% 7.13/2.29  # SZS status Theorem
% 7.13/2.29  # SZS output start CNFRefutation
% See solution above
% 7.13/2.29  # Training examples: 0 positive, 0 negative
% 7.13/2.29  
% 7.13/2.29  # -------------------------------------------------
% 7.13/2.29  # User time                : 0.014 s
% 7.13/2.29  # System time              : 0.004 s
% 7.13/2.29  # Total time               : 0.018 s
% 7.13/2.29  # Maximum resident set size: 7124 pages
% 7.13/2.29  
%------------------------------------------------------------------------------