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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU157+1 : TPTP v8.1.0. Released v3.3.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 08:38:58 EDT 2022

% Result   : Theorem 7.71s 2.30s
% Output   : CNFRefutation 7.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   35 (   6 unt;   4 nHn;  33 RR)
%            Number of literals    :   79 (  29 equ;  44 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-4 aty)
%            Number of variables   :   93 (   9 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_23,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X2,X4),singleton(X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_23) ).

cnf(i_0_2,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_2) ).

cnf(i_0_8,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_8) ).

cnf(i_0_10,plain,
    ( in(esk1_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_10) ).

cnf(i_0_22,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(unordered_pair(X4,X2),singleton(X4)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_22) ).

cnf(i_0_9,plain,
    ( in(esk2_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_9) ).

cnf(i_0_18,negated_conjecture,
    ( in(esk6_0,esk8_0)
    | in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_18) ).

cnf(i_0_19,negated_conjecture,
    ( ~ in(esk6_0,esk8_0)
    | ~ in(esk7_0,esk9_0)
    | ~ in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_19) ).

cnf(i_0_17,negated_conjecture,
    ( in(esk7_0,esk9_0)
    | in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_17) ).

cnf(i_0_7,plain,
    ( in(X1,X2)
    | X2 != cartesian_product2(X3,X4)
    | X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
    | ~ in(X6,X4)
    | ~ in(X5,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-khlycixu/lgb.p',i_0_7) ).

cnf(c_0_34,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X2,X4),singleton(X2)) ),
    i_0_23 ).

cnf(c_0_35,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_2 ).

cnf(c_0_36,plain,
    ( unordered_pair(unordered_pair(esk1_4(X1,X2,X3,X4),esk2_4(X1,X2,X3,X4)),singleton(esk1_4(X1,X2,X3,X4))) = X4
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_8 ).

cnf(c_0_37,plain,
    ( in(esk1_4(X1,X2,X3,X4),X1)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_10 ).

cnf(c_0_38,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(singleton(X2),unordered_pair(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    ( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_35])]) ).

cnf(c_0_40,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(unordered_pair(X4,X2),singleton(X4)) ),
    i_0_22 ).

cnf(c_0_41,plain,
    ( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_37]) ).

cnf(c_0_42,plain,
    ( esk1_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(unordered_pair(X3,X4),singleton(X3))) = X3
    | ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39])]) ).

cnf(c_0_43,plain,
    ( in(esk2_4(X1,X2,X3,X4),X2)
    | X3 != cartesian_product2(X1,X2)
    | ~ in(X4,X3) ),
    i_0_9 ).

cnf(c_0_44,plain,
    ( X1 = X2
    | unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(singleton(X4),unordered_pair(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_35]) ).

cnf(c_0_45,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    ( in(esk6_0,esk8_0)
    | in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    i_0_18 ).

cnf(c_0_47,plain,
    ( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
    | ~ in(X3,cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[c_0_43]) ).

cnf(c_0_48,plain,
    ( esk2_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(unordered_pair(X3,X4),singleton(X3))) = X4
    | ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),cartesian_product2(X1,X2)) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39])]) ).

cnf(c_0_49,negated_conjecture,
    ( ~ in(esk6_0,esk8_0)
    | ~ in(esk7_0,esk9_0)
    | ~ in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    i_0_19 ).

cnf(c_0_50,negated_conjecture,
    in(esk6_0,esk8_0),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_51,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    ( in(esk7_0,esk9_0)
    | in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)) ),
    i_0_17 ).

cnf(c_0_53,negated_conjecture,
    ( ~ in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0))
    | ~ in(esk7_0,esk9_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50])]) ).

cnf(c_0_54,negated_conjecture,
    in(esk7_0,esk9_0),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

cnf(c_0_55,plain,
    ( in(X1,X2)
    | X2 != cartesian_product2(X3,X4)
    | X1 != unordered_pair(unordered_pair(X5,X6),singleton(X5))
    | ~ in(X6,X4)
    | ~ in(X5,X3) ),
    i_0_7 ).

cnf(c_0_56,negated_conjecture,
    ~ in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),cartesian_product2(esk8_0,esk9_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).

cnf(c_0_57,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_55])]) ).

cnf(c_0_58,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_54]),c_0_50])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SEU157+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 : 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 : Sun Jun 19 11:27:19 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.71/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.71/2.30  # No SInE strategy applied
% 7.71/2.30  # Trying AutoSched0 for 150 seconds
% 7.71/2.30  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S05AN
% 7.71/2.30  # and selection function PSelectComplexExceptUniqMaxPosHorn.
% 7.71/2.30  #
% 7.71/2.30  # Preprocessing time       : 0.012 s
% 7.71/2.30  # Presaturation interreduction done
% 7.71/2.30  
% 7.71/2.30  # Proof found!
% 7.71/2.30  # SZS status Theorem
% 7.71/2.30  # SZS output start CNFRefutation
% See solution above
% 7.71/2.30  # Training examples: 0 positive, 0 negative
% 7.71/2.30  
% 7.71/2.30  # -------------------------------------------------
% 7.71/2.30  # User time                : 0.017 s
% 7.71/2.30  # System time              : 0.005 s
% 7.71/2.30  # Total time               : 0.021 s
% 7.71/2.30  # Maximum resident set size: 7124 pages
% 7.71/2.30  
%------------------------------------------------------------------------------