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

View Problem - Process Solution

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

% Computer : n021.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 00:15:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_10) ).

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

cnf(i_0_14,negated_conjecture,
    ( esk7_0 = esk5_0
    | in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_14) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_6) ).

cnf(i_0_15,negated_conjecture,
    ( esk4_0 = esk6_0
    | in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_15) ).

cnf(i_0_16,negated_conjecture,
    ( esk4_0 != esk6_0
    | esk7_0 != esk5_0
    | ~ in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_16) ).

cnf(i_0_11,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_11) ).

cnf(i_0_9,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-xq4yryz2/lgb.p',i_0_9) ).

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

cnf(c_0_26,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),cartesian_product2(X4,X2)) ),
    i_0_10 ).

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

cnf(c_0_28,negated_conjecture,
    ( esk7_0 = esk5_0
    | in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    i_0_14 ).

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

cnf(c_0_30,negated_conjecture,
    ( esk4_0 = esk6_0
    | in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    i_0_15 ).

cnf(c_0_31,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ( esk7_0 = esk5_0
    | in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    inference(rw,[status(thm)],[c_0_28,c_0_27]) ).

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

cnf(c_0_34,negated_conjecture,
    ( esk4_0 != esk6_0
    | esk7_0 != esk5_0
    | ~ in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    i_0_16 ).

cnf(c_0_35,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),cartesian_product2(X2,X4)) ),
    i_0_11 ).

cnf(c_0_36,negated_conjecture,
    ( esk6_0 = esk4_0
    | in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    inference(rw,[status(thm)],[c_0_30,c_0_27]) ).

cnf(c_0_37,negated_conjecture,
    esk7_0 = esk5_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ( esk7_0 != esk5_0
    | esk6_0 != esk4_0
    | ~ in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk6_0),singleton(esk7_0))) ),
    inference(rw,[status(thm)],[c_0_34,c_0_27]) ).

cnf(c_0_39,plain,
    ( in(X1,X2)
    | ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4)) ),
    inference(rw,[status(thm)],[c_0_35,c_0_27]) ).

cnf(c_0_40,negated_conjecture,
    ( esk6_0 = esk4_0
    | in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk6_0),singleton(esk5_0))) ),
    inference(rw,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,negated_conjecture,
    ( esk6_0 != esk4_0
    | ~ in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk6_0),singleton(esk5_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_37]),c_0_37])]) ).

cnf(c_0_42,plain,
    esk6_0 = esk4_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]) ).

cnf(c_0_43,plain,
    ( in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    i_0_9 ).

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

cnf(c_0_45,negated_conjecture,
    ~ in(unordered_pair(singleton(esk4_0),unordered_pair(esk4_0,esk5_0)),cartesian_product2(singleton(esk4_0),singleton(esk5_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42])]) ).

cnf(c_0_46,plain,
    ( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))
    | ~ in(X2,X4)
    | ~ in(X1,X3) ),
    inference(rw,[status(thm)],[c_0_43,c_0_27]) ).

cnf(c_0_47,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET893+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 02:54:39 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.45/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.45/2.32  # No SInE strategy applied
% 7.45/2.32  # Trying AutoSched0 for 150 seconds
% 7.45/2.32  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.45/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.45/2.32  #
% 7.45/2.32  # Preprocessing time       : 0.023 s
% 7.45/2.32  # Presaturation interreduction done
% 7.45/2.32  
% 7.45/2.32  # Proof found!
% 7.45/2.32  # SZS status Theorem
% 7.45/2.32  # SZS output start CNFRefutation
% See solution above
% 7.45/2.32  # Training examples: 0 positive, 0 negative
% 7.45/2.32  
% 7.45/2.32  # -------------------------------------------------
% 7.45/2.32  # User time                : 0.027 s
% 7.45/2.32  # System time              : 0.004 s
% 7.45/2.32  # Total time               : 0.031 s
% 7.45/2.32  # Maximum resident set size: 7124 pages
% 7.45/2.32  
%------------------------------------------------------------------------------