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

View Problem - Process Solution

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

% Computer : n029.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 : Mon Jul 18 08:35:36 EDT 2022

% Result   : Theorem 8.88s 2.50s
% Output   : CNFRefutation 8.88s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   21 (  11 unt;   5 nHn;  19 RR)
%            Number of literals    :   39 (  11 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

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

cnf(i_0_53,plain,
    in(X1,set_union2(X1,singleton(X1))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-btku6ujb/input.p',i_0_53) ).

cnf(i_0_55,negated_conjecture,
    set_union2(esk14_0,singleton(esk14_0)) = set_union2(esk15_0,singleton(esk15_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-btku6ujb/input.p',i_0_55) ).

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

cnf(i_0_54,negated_conjecture,
    esk14_0 != esk15_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-btku6ujb/input.p',i_0_54) ).

cnf(i_0_1,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-btku6ujb/input.p',i_0_1) ).

cnf(c_0_62,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | X4 != set_union2(X3,X2)
    | ~ in(X1,X4) ),
    i_0_18 ).

cnf(c_0_63,plain,
    in(X1,set_union2(X1,singleton(X1))),
    i_0_53 ).

cnf(c_0_64,negated_conjecture,
    set_union2(esk14_0,singleton(esk14_0)) = set_union2(esk15_0,singleton(esk15_0)),
    i_0_55 ).

cnf(c_0_65,plain,
    ( X1 = X2
    | X3 != singleton(X2)
    | ~ in(X1,X3) ),
    i_0_12 ).

cnf(c_0_66,plain,
    ( in(X1,X2)
    | in(X1,X3)
    | ~ in(X1,set_union2(X2,X3)) ),
    inference(er,[status(thm)],[c_0_62]) ).

cnf(c_0_67,negated_conjecture,
    in(esk14_0,set_union2(esk15_0,singleton(esk15_0))),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

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

cnf(c_0_69,plain,
    ( in(esk14_0,singleton(esk15_0))
    | in(esk14_0,esk15_0) ),
    inference(spm,[status(thm)],[c_0_66,c_0_67]) ).

cnf(c_0_70,negated_conjecture,
    esk14_0 != esk15_0,
    i_0_54 ).

cnf(c_0_71,plain,
    ( ~ in(X1,X2)
    | ~ in(X2,X1) ),
    i_0_1 ).

cnf(c_0_72,plain,
    in(esk14_0,esk15_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70]) ).

cnf(c_0_73,negated_conjecture,
    ( in(X1,singleton(esk14_0))
    | in(X1,esk14_0)
    | ~ in(X1,set_union2(esk15_0,singleton(esk15_0))) ),
    inference(spm,[status(thm)],[c_0_66,c_0_64]) ).

cnf(c_0_74,plain,
    ~ in(esk15_0,esk14_0),
    inference(spm,[status(thm)],[c_0_71,c_0_72]) ).

cnf(c_0_75,plain,
    in(esk15_0,singleton(esk14_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_63]),c_0_74]) ).

cnf(c_0_76,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_75]),c_0_70]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM385+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul  5 03:28:43 EDT 2022
% 0.19/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.88/2.50  # ENIGMATIC: Solved by autoschedule:
% 8.88/2.50  # No SInE strategy applied
% 8.88/2.50  # Trying AutoSched0 for 150 seconds
% 8.88/2.50  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 8.88/2.50  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.88/2.50  #
% 8.88/2.50  # Preprocessing time       : 0.022 s
% 8.88/2.50  # Presaturation interreduction done
% 8.88/2.50  
% 8.88/2.50  # Proof found!
% 8.88/2.50  # SZS status Theorem
% 8.88/2.50  # SZS output start CNFRefutation
% See solution above
% 8.88/2.50  # Training examples: 0 positive, 0 negative
% 8.88/2.50  
% 8.88/2.50  # -------------------------------------------------
% 8.88/2.50  # User time                : 0.029 s
% 8.88/2.50  # System time              : 0.006 s
% 8.88/2.50  # Total time               : 0.035 s
% 8.88/2.50  # Maximum resident set size: 7112 pages
% 8.88/2.50  
%------------------------------------------------------------------------------