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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU264+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:40:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_21,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_21) ).

cnf(i_0_19,negated_conjecture,
    subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_19) ).

cnf(i_0_15,plain,
    ( subset(relation_rng(X1),X2)
    | ~ relation_of2_as_subset(X1,X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_15) ).

cnf(i_0_20,negated_conjecture,
    relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_20) ).

cnf(i_0_14,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_14) ).

cnf(i_0_17,plain,
    ( relation_of2_as_subset(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X4)
    | ~ subset(relation_rng(X1),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_17) ).

cnf(i_0_18,negated_conjecture,
    ~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x4sy7j5u/input.p',i_0_18) ).

cnf(c_0_29,plain,
    ( subset(X1,X2)
    | ~ subset(X3,X2)
    | ~ subset(X1,X3) ),
    i_0_21 ).

cnf(c_0_30,negated_conjecture,
    subset(esk4_0,esk5_0),
    i_0_19 ).

cnf(c_0_31,negated_conjecture,
    ( subset(X1,esk5_0)
    | ~ subset(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_32,plain,
    ( subset(relation_rng(X1),X2)
    | ~ relation_of2_as_subset(X1,X3,X2) ),
    i_0_15 ).

cnf(c_0_33,negated_conjecture,
    relation_of2_as_subset(esk7_0,esk6_0,esk4_0),
    i_0_20 ).

cnf(c_0_34,plain,
    ( subset(X1,esk5_0)
    | ~ subset(X2,esk4_0)
    | ~ subset(X1,X2) ),
    inference(spm,[status(thm)],[c_0_29,c_0_31]) ).

cnf(c_0_35,negated_conjecture,
    subset(relation_rng(esk7_0),esk4_0),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    ( subset(X1,esk5_0)
    | ~ subset(X1,relation_rng(esk7_0)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_37,plain,
    subset(X1,X1),
    i_0_14 ).

cnf(c_0_38,plain,
    ( relation_of2_as_subset(X1,X2,X3)
    | ~ relation_of2_as_subset(X1,X2,X4)
    | ~ subset(relation_rng(X1),X3) ),
    i_0_17 ).

cnf(c_0_39,plain,
    subset(relation_rng(esk7_0),esk5_0),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_40,plain,
    ( relation_of2_as_subset(esk7_0,X1,esk5_0)
    | ~ relation_of2_as_subset(esk7_0,X1,X2) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_41,negated_conjecture,
    ~ relation_of2_as_subset(esk7_0,esk6_0,esk5_0),
    i_0_18 ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_33]),c_0_41]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU264+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n024.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 16:58:49 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.79/2.39  # ENIGMATIC: Solved by autoschedule:
% 7.79/2.39  # No SInE strategy applied
% 7.79/2.39  # Trying AutoSched0 for 150 seconds
% 7.79/2.39  # AutoSched0-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 7.79/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.79/2.39  #
% 7.79/2.39  # Preprocessing time       : 0.023 s
% 7.79/2.39  
% 7.79/2.39  # Proof found!
% 7.79/2.39  # SZS status Theorem
% 7.79/2.39  # SZS output start CNFRefutation
% See solution above
% 7.79/2.39  # Training examples: 0 positive, 0 negative
% 7.79/2.39  
% 7.79/2.39  # -------------------------------------------------
% 7.79/2.39  # User time                : 0.026 s
% 7.79/2.39  # System time              : 0.005 s
% 7.79/2.39  # Total time               : 0.031 s
% 7.79/2.39  # Maximum resident set size: 7124 pages
% 7.79/2.39  
%------------------------------------------------------------------------------