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

View Problem - Process Solution

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

% Computer : n004.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 00:12:39 EDT 2022

% Result   : Theorem 9.43s 2.57s
% Output   : CNFRefutation 9.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   21 (   8 unt;   7 nHn;  12 RR)
%            Number of literals    :   39 (   5 equ;  15 neg)
%            Maximal clause size   :    3 (   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   :   38 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( subset(X1,X2)
    | ~ member(esk3_2(X1,X2),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_14) ).

cnf(i_0_3,plain,
    ( member(X1,X2)
    | member(X1,difference(X3,X2))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_3) ).

cnf(i_0_15,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_15) ).

cnf(i_0_5,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_5) ).

cnf(i_0_6,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_6) ).

cnf(i_0_7,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_7) ).

cnf(i_0_20,negated_conjecture,
    difference(esk5_0,empty_set) != esk5_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rmykkjq4/lgb.p',i_0_20) ).

cnf(c_0_28,plain,
    ( subset(X1,X2)
    | ~ member(esk3_2(X1,X2),X2) ),
    i_0_14 ).

cnf(c_0_29,plain,
    ( member(X1,X2)
    | member(X1,difference(X3,X2))
    | ~ member(X1,X3) ),
    i_0_3 ).

cnf(c_0_30,plain,
    ( member(esk3_2(X1,difference(X2,X3)),X3)
    | subset(X1,difference(X2,X3))
    | ~ member(esk3_2(X1,difference(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),X1) ),
    i_0_15 ).

cnf(c_0_32,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    i_0_5 ).

cnf(c_0_33,plain,
    ~ member(X1,empty_set),
    i_0_6 ).

cnf(c_0_34,plain,
    ( member(esk3_2(X1,difference(X1,X2)),X2)
    | subset(X1,difference(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,plain,
    ( member(esk3_2(difference(X1,X2),X3),X1)
    | subset(difference(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_32,c_0_31]) ).

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

cnf(c_0_37,plain,
    subset(X1,difference(X1,empty_set)),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    subset(difference(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_28,c_0_35]) ).

cnf(c_0_39,negated_conjecture,
    difference(esk5_0,empty_set) != esk5_0,
    i_0_20 ).

cnf(c_0_40,plain,
    difference(X1,empty_set) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38])]) ).

cnf(c_0_41,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n004.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 14:34:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 9.43/2.57  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.43/2.57  # No SInE strategy applied
% 9.43/2.57  # Trying AutoSched0 for 150 seconds
% 9.43/2.57  # AutoSched0-Mode selected heuristic G_____0010_evo
% 9.43/2.57  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.43/2.57  #
% 9.43/2.57  # Preprocessing time       : 0.021 s
% 9.43/2.57  
% 9.43/2.57  # Proof found!
% 9.43/2.57  # SZS status Theorem
% 9.43/2.57  # SZS output start CNFRefutation
% See solution above
% 9.43/2.57  # Training examples: 0 positive, 0 negative
% 9.43/2.57  
% 9.43/2.57  # -------------------------------------------------
% 9.43/2.57  # User time                : 0.030 s
% 9.43/2.57  # System time              : 0.005 s
% 9.43/2.57  # Total time               : 0.035 s
% 9.43/2.57  # Maximum resident set size: 7128 pages
% 9.43/2.57  
%------------------------------------------------------------------------------