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

View Problem - Process Solution

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

% Computer : n013.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:50 EDT 2022

% Result   : Theorem 8.13s 2.39s
% Output   : CNFRefutation 8.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (   7 unt;   4 nHn;  13 RR)
%            Number of literals    :   43 (  23 equ;  17 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   29 (   0 sgn)

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

cnf(i_0_20,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_20) ).

cnf(i_0_6,plain,
    ( X1 = powerset(X2)
    | in(esk2_2(X2,X1),X1)
    | subset(esk2_2(X2,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_6) ).

cnf(i_0_17,negated_conjecture,
    singleton(empty_set) != powerset(empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_17) ).

cnf(i_0_4,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_4) ).

cnf(i_0_7,plain,
    ( X1 = powerset(X2)
    | ~ in(esk2_2(X2,X1),X1)
    | ~ subset(esk2_2(X2,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_7) ).

cnf(i_0_16,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-5g0us6pr/input.p',i_0_16) ).

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

cnf(c_0_29,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    i_0_20 ).

cnf(c_0_30,plain,
    ( X1 = powerset(X2)
    | in(esk2_2(X2,X1),X1)
    | subset(esk2_2(X2,X1),X2) ),
    i_0_6 ).

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

cnf(c_0_32,plain,
    ( esk2_2(empty_set,X1) = empty_set
    | X1 = powerset(empty_set)
    | in(esk2_2(empty_set,X1),X1) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    ( esk2_2(empty_set,singleton(X1)) = empty_set
    | esk2_2(empty_set,singleton(X1)) = X1
    | singleton(X1) = powerset(empty_set) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_34,negated_conjecture,
    singleton(empty_set) != powerset(empty_set),
    i_0_17 ).

cnf(c_0_35,plain,
    ( in(X1,X2)
    | X1 != X3
    | X2 != singleton(X3) ),
    i_0_4 ).

cnf(c_0_36,plain,
    ( X1 = powerset(X2)
    | ~ in(esk2_2(X2,X1),X1)
    | ~ subset(esk2_2(X2,X1),X2) ),
    i_0_7 ).

cnf(c_0_37,plain,
    esk2_2(empty_set,singleton(empty_set)) = empty_set,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_33])]),c_0_34]) ).

cnf(c_0_38,plain,
    in(X1,singleton(X1)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])]) ).

cnf(c_0_39,plain,
    subset(X1,X1),
    i_0_16 ).

cnf(c_0_40,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39])]),c_0_34]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU147+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n013.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 02:09:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.13/2.39  # ENIGMATIC: Solved by autoschedule:
% 8.13/2.39  # No SInE strategy applied
% 8.13/2.39  # Trying AutoSched0 for 150 seconds
% 8.13/2.39  # AutoSched0-Mode selected heuristic G_____0010_evo
% 8.13/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.13/2.39  #
% 8.13/2.39  # Preprocessing time       : 0.023 s
% 8.13/2.39  
% 8.13/2.39  # Proof found!
% 8.13/2.39  # SZS status Theorem
% 8.13/2.39  # SZS output start CNFRefutation
% See solution above
% 8.13/2.39  # Training examples: 0 positive, 0 negative
% 8.13/2.39  
% 8.13/2.39  # -------------------------------------------------
% 8.13/2.39  # User time                : 0.022 s
% 8.13/2.39  # System time              : 0.008 s
% 8.13/2.39  # Total time               : 0.031 s
% 8.13/2.39  # Maximum resident set size: 7120 pages
% 8.13/2.39  
%------------------------------------------------------------------------------