TSTP Solution File: SEU162+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n019.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:39:02 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( disjoint(X1,X2)
    | ~ disjoint(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_6) ).

cnf(i_0_3,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_3) ).

cnf(i_0_8,negated_conjecture,
    ( in(esk4_0,esk3_0)
    | set_difference(esk3_0,singleton(esk4_0)) != esk3_0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_8) ).

cnf(i_0_10,plain,
    ( set_difference(X1,X2) = X1
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_10) ).

cnf(i_0_7,negated_conjecture,
    ( set_difference(esk3_0,singleton(esk4_0)) = esk3_0
    | ~ in(esk4_0,esk3_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_7) ).

cnf(i_0_9,plain,
    ( disjoint(X1,X2)
    | set_difference(X1,X2) != X1 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_9) ).

cnf(i_0_2,plain,
    ( ~ in(X1,X2)
    | ~ disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lj15tft1/input.p',i_0_2) ).

cnf(c_0_18,plain,
    ( disjoint(X1,X2)
    | ~ disjoint(X2,X1) ),
    i_0_6 ).

cnf(c_0_19,plain,
    ( in(X1,X2)
    | disjoint(singleton(X1),X2) ),
    i_0_3 ).

cnf(c_0_20,negated_conjecture,
    ( in(esk4_0,esk3_0)
    | set_difference(esk3_0,singleton(esk4_0)) != esk3_0 ),
    i_0_8 ).

cnf(c_0_21,plain,
    ( set_difference(X1,X2) = X1
    | ~ disjoint(X1,X2) ),
    i_0_10 ).

cnf(c_0_22,plain,
    ( disjoint(X1,singleton(X2))
    | in(X2,X1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    ( set_difference(esk3_0,singleton(esk4_0)) = esk3_0
    | ~ in(esk4_0,esk3_0) ),
    i_0_7 ).

cnf(c_0_24,plain,
    in(esk4_0,esk3_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_25,plain,
    ( disjoint(X1,X2)
    | set_difference(X1,X2) != X1 ),
    i_0_9 ).

cnf(c_0_26,negated_conjecture,
    set_difference(esk3_0,singleton(esk4_0)) = esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).

cnf(c_0_27,plain,
    disjoint(esk3_0,singleton(esk4_0)),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,plain,
    ( ~ in(X1,X2)
    | ~ disjoint(singleton(X1),X2) ),
    i_0_2 ).

cnf(c_0_29,plain,
    disjoint(singleton(esk4_0),esk3_0),
    inference(spm,[status(thm)],[c_0_18,c_0_27]) ).

cnf(c_0_30,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24])]),
    [proof] ).

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