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

View Problem - Process Solution

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

% Computer : n023.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:47 EDT 2022

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

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

cnf(i_0_7,plain,
    ( X1 = unordered_pair(X2,X3)
    | esk2_3(X2,X3,X1) = X3
    | esk2_3(X2,X3,X1) = X2
    | in(esk2_3(X2,X3,X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pr_3iqyh/input.p',i_0_7) ).

cnf(i_0_5,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pr_3iqyh/input.p',i_0_5) ).

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

cnf(i_0_17,negated_conjecture,
    unordered_pair(esk4_0,esk4_0) != singleton(esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-pr_3iqyh/input.p',i_0_17) ).

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

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

cnf(c_0_25,plain,
    ( X1 = unordered_pair(X2,X3)
    | esk2_3(X2,X3,X1) = X3
    | esk2_3(X2,X3,X1) = X2
    | in(esk2_3(X2,X3,X1),X1) ),
    i_0_7 ).

cnf(c_0_26,plain,
    ( esk2_3(X1,X2,singleton(X3)) = X2
    | esk2_3(X1,X2,singleton(X3)) = X1
    | esk2_3(X1,X2,singleton(X3)) = X3
    | singleton(X3) = unordered_pair(X1,X2) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_27,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_5 ).

cnf(c_0_28,plain,
    ( esk2_3(X1,X1,singleton(X2)) = X2
    | esk2_3(X1,X1,singleton(X2)) = X1
    | singleton(X2) = unordered_pair(X1,X1) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_26])]) ).

cnf(c_0_29,plain,
    ( in(X1,X2)
    | X2 != singleton(X1) ),
    inference(er,[status(thm)],[c_0_27]) ).

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

cnf(c_0_31,plain,
    ( esk2_3(X1,X1,singleton(X1)) = X1
    | singleton(X1) = unordered_pair(X1,X1) ),
    inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_28])]) ).

cnf(c_0_32,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    unordered_pair(esk4_0,esk4_0) != singleton(esk4_0),
    i_0_17 ).

cnf(c_0_34,plain,
    singleton(X1) = unordered_pair(X1,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).

cnf(c_0_35,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_34])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n023.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 10:02:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.77/2.31  # ENIGMATIC: Solved by autoschedule:
% 7.77/2.31  # No SInE strategy applied
% 7.77/2.31  # Trying AutoSched0 for 150 seconds
% 7.77/2.31  # AutoSched0-Mode selected heuristic H_____047_C18_F1_PI_AE_R8_CS_SP_S2S
% 7.77/2.31  # and selection function SelectNewComplexAHP.
% 7.77/2.31  #
% 7.77/2.31  # Preprocessing time       : 0.012 s
% 7.77/2.31  
% 7.77/2.31  # Proof found!
% 7.77/2.31  # SZS status Theorem
% 7.77/2.31  # SZS output start CNFRefutation
% See solution above
% 7.77/2.31  # Training examples: 0 positive, 0 negative
% 7.77/2.31  
% 7.77/2.31  # -------------------------------------------------
% 7.77/2.31  # User time                : 0.015 s
% 7.77/2.31  # System time              : 0.005 s
% 7.77/2.31  # Total time               : 0.020 s
% 7.77/2.31  # Maximum resident set size: 7120 pages
% 7.77/2.31  
%------------------------------------------------------------------------------