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

View Problem - Process Solution

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

% Computer : n017.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:55 EDT 2022

% Result   : Theorem 7.64s 2.31s
% Output   : CNFRefutation 7.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   9 unt;   0 nHn;  11 RR)
%            Number of literals    :   17 (   7 equ;   7 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   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_8,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z64ozzi7/lgb.p',i_0_8) ).

cnf(i_0_7,negated_conjecture,
    in(esk1_0,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z64ozzi7/lgb.p',i_0_7) ).

cnf(i_0_6,negated_conjecture,
    set_union2(singleton(esk1_0),esk2_0) != esk2_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z64ozzi7/lgb.p',i_0_6) ).

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

cnf(i_0_11,plain,
    ( set_union2(X1,X2) = X2
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z64ozzi7/lgb.p',i_0_11) ).

cnf(c_0_17,plain,
    ( subset(singleton(X1),X2)
    | ~ in(X1,X2) ),
    i_0_8 ).

cnf(c_0_18,negated_conjecture,
    in(esk1_0,esk2_0),
    i_0_7 ).

cnf(c_0_19,negated_conjecture,
    set_union2(singleton(esk1_0),esk2_0) != esk2_0,
    i_0_6 ).

cnf(c_0_20,plain,
    set_union2(X1,X2) = set_union2(X2,X1),
    i_0_2 ).

cnf(c_0_21,plain,
    ( set_union2(X1,X2) = X2
    | ~ subset(X1,X2) ),
    i_0_11 ).

cnf(c_0_22,negated_conjecture,
    subset(singleton(esk1_0),esk2_0),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,negated_conjecture,
    set_union2(esk2_0,singleton(esk1_0)) != esk2_0,
    inference(rw,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_20]),c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU152+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n017.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 : Mon Jun 20 02:06:45 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.64/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.64/2.31  # No SInE strategy applied
% 7.64/2.31  # Trying AutoSched0 for 150 seconds
% 7.64/2.31  # AutoSched0-Mode selected heuristic G_E___208_B01_00_F1_SE_CS_SP_PS_S064A
% 7.64/2.31  # and selection function SelectComplexG.
% 7.64/2.31  #
% 7.64/2.31  # Preprocessing time       : 0.023 s
% 7.64/2.31  # Presaturation interreduction done
% 7.64/2.31  
% 7.64/2.31  # Proof found!
% 7.64/2.31  # SZS status Theorem
% 7.64/2.31  # SZS output start CNFRefutation
% See solution above
% 7.64/2.31  # Training examples: 0 positive, 0 negative
% 7.64/2.31  
% 7.64/2.31  # -------------------------------------------------
% 7.64/2.31  # User time                : 0.024 s
% 7.64/2.31  # System time              : 0.005 s
% 7.64/2.31  # Total time               : 0.029 s
% 7.64/2.31  # Maximum resident set size: 7124 pages
% 7.64/2.31  
%------------------------------------------------------------------------------