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

View Problem - Process Solution

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

% Computer : n028.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:14:59 EDT 2022

% Result   : Theorem 7.62s 2.25s
% Output   : CNFRefutation 7.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  10 unt;   3 nHn;  12 RR)
%            Number of literals    :   33 (  19 equ;  17 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,negated_conjecture,
    set_difference(unordered_pair(esk4_0,esk5_0),singleton(esk5_0)) != singleton(esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8kj5wfny/lgb.p',i_0_13) ).

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

cnf(i_0_8,plain,
    ( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
    | in(X1,X3)
    | ~ in(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8kj5wfny/lgb.p',i_0_8) ).

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

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

cnf(i_0_14,negated_conjecture,
    esk4_0 != esk5_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8kj5wfny/lgb.p',i_0_14) ).

cnf(c_0_21,negated_conjecture,
    set_difference(unordered_pair(esk4_0,esk5_0),singleton(esk5_0)) != singleton(esk4_0),
    i_0_13 ).

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

cnf(c_0_23,plain,
    ( set_difference(unordered_pair(X1,X2),X3) = singleton(X1)
    | in(X1,X3)
    | ~ in(X2,X3) ),
    i_0_8 ).

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

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

cnf(c_0_26,negated_conjecture,
    set_difference(unordered_pair(esk5_0,esk4_0),singleton(esk5_0)) != singleton(esk4_0),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_27,plain,
    ( set_difference(unordered_pair(X1,X2),X3) = singleton(X2)
    | in(X2,X3)
    | ~ in(X1,X3) ),
    inference(spm,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_28,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_24])]) ).

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

cnf(c_0_30,negated_conjecture,
    in(esk4_0,singleton(esk5_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).

cnf(c_0_31,negated_conjecture,
    esk4_0 != esk5_0,
    i_0_14 ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SET882+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon Jul 11 08:59:15 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 7.62/2.25  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.62/2.25  # No SInE strategy applied
% 7.62/2.25  # Trying AutoSched0 for 150 seconds
% 7.62/2.25  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.62/2.25  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.62/2.25  #
% 7.62/2.25  # Preprocessing time       : 0.022 s
% 7.62/2.25  
% 7.62/2.25  # Proof found!
% 7.62/2.25  # SZS status Theorem
% 7.62/2.25  # SZS output start CNFRefutation
% See solution above
% 7.62/2.25  # Training examples: 0 positive, 0 negative
% 7.62/2.25  
% 7.62/2.25  # -------------------------------------------------
% 7.62/2.25  # User time                : 0.025 s
% 7.62/2.25  # System time              : 0.003 s
% 7.62/2.25  # Total time               : 0.028 s
% 7.62/2.25  # Maximum resident set size: 7120 pages
% 7.62/2.25  
%------------------------------------------------------------------------------