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

View Problem - Process Solution

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

% Computer : n024.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.59s 2.33s
% Output   : CNFRefutation 7.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   19 (   4 unt;   3 nHn;  16 RR)
%            Number of literals    :   34 (   8 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/sandbox2/tmp/enigma-theBenchmark.p-vulcby9t/lgb.p',i_0_6) ).

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

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

cnf(i_0_7,negated_conjecture,
    ( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
    | ~ in(esk2_0,esk1_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vulcby9t/lgb.p',i_0_7) ).

cnf(i_0_8,negated_conjecture,
    ( in(esk2_0,esk1_0)
    | set_difference(esk1_0,singleton(esk2_0)) != esk1_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vulcby9t/lgb.p',i_0_8) ).

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

cnf(i_0_4,plain,
    ( ~ in(X1,X2)
    | ~ disjoint(singleton(X1),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vulcby9t/lgb.p',i_0_4) ).

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_5 ).

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

cnf(c_0_21,negated_conjecture,
    ( set_difference(esk1_0,singleton(esk2_0)) = esk1_0
    | ~ in(esk2_0,esk1_0) ),
    i_0_7 ).

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,
    disjoint(esk1_0,singleton(esk2_0)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    ( in(esk2_0,esk1_0)
    | set_difference(esk1_0,singleton(esk2_0)) != esk1_0 ),
    i_0_8 ).

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

cnf(c_0_26,plain,
    ( ~ in(X1,X2)
    | ~ disjoint(singleton(X1),X2) ),
    i_0_4 ).

cnf(c_0_27,plain,
    disjoint(singleton(esk2_0),esk1_0),
    inference(spm,[status(thm)],[c_0_18,c_0_23]) ).

cnf(c_0_28,plain,
    in(esk2_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n024.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 : Sun Jun 19 05:09:19 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.59/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.33  # No SInE strategy applied
% 7.59/2.33  # Trying AutoSched0 for 150 seconds
% 7.59/2.33  # AutoSched0-Mode selected heuristic G_____0010_evo
% 7.59/2.33  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.59/2.33  #
% 7.59/2.33  # Preprocessing time       : 0.012 s
% 7.59/2.33  
% 7.59/2.33  # Proof found!
% 7.59/2.33  # SZS status Theorem
% 7.59/2.33  # SZS output start CNFRefutation
% See solution above
% 7.59/2.33  # Training examples: 0 positive, 0 negative
% 7.59/2.33  
% 7.59/2.33  # -------------------------------------------------
% 7.59/2.33  # User time                : 0.011 s
% 7.59/2.33  # System time              : 0.004 s
% 7.59/2.33  # Total time               : 0.015 s
% 7.59/2.33  # Maximum resident set size: 7120 pages
% 7.59/2.33  
%------------------------------------------------------------------------------