TSTP Solution File: SEU355+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n003.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:41:07 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_279,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_279) ).

cnf(i_0_487,plain,
    ( relstr_element_smaller(X1,X2,X3)
    | in(esk98_3(X1,X2,X3),X2)
    | ~ rel_str(X1)
    | ~ element(X3,the_carrier(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_487) ).

cnf(i_0_2665,negated_conjecture,
    element(esk436_0,the_carrier(esk435_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_2665) ).

cnf(i_0_2666,negated_conjecture,
    rel_str(esk435_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_2666) ).

cnf(i_0_519,plain,
    ( relstr_set_smaller(X1,X2,X3)
    | in(esk109_3(X1,X2,X3),X2)
    | ~ rel_str(X1)
    | ~ element(X3,the_carrier(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_519) ).

cnf(i_0_2664,negated_conjecture,
    ( ~ relstr_element_smaller(esk435_0,empty_set,esk436_0)
    | ~ relstr_set_smaller(esk435_0,empty_set,esk436_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-rip0y9ij/lgb.p',i_0_2664) ).

cnf(c_0_2673,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_279 ).

cnf(c_0_2674,plain,
    ( relstr_element_smaller(X1,X2,X3)
    | in(esk98_3(X1,X2,X3),X2)
    | ~ rel_str(X1)
    | ~ element(X3,the_carrier(X1)) ),
    i_0_487 ).

cnf(c_0_2675,negated_conjecture,
    element(esk436_0,the_carrier(esk435_0)),
    i_0_2665 ).

cnf(c_0_2676,negated_conjecture,
    rel_str(esk435_0),
    i_0_2666 ).

cnf(c_0_2677,plain,
    ~ in(X1,empty_set),
    inference(er,[status(thm)],[c_0_2673]) ).

cnf(c_0_2678,negated_conjecture,
    ( in(esk98_3(esk435_0,X1,esk436_0),X1)
    | relstr_element_smaller(esk435_0,X1,esk436_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2674,c_0_2675]),c_0_2676])]) ).

cnf(c_0_2679,plain,
    ( relstr_set_smaller(X1,X2,X3)
    | in(esk109_3(X1,X2,X3),X2)
    | ~ rel_str(X1)
    | ~ element(X3,the_carrier(X1)) ),
    i_0_519 ).

cnf(c_0_2680,negated_conjecture,
    ( ~ relstr_element_smaller(esk435_0,empty_set,esk436_0)
    | ~ relstr_set_smaller(esk435_0,empty_set,esk436_0) ),
    i_0_2664 ).

cnf(c_0_2681,plain,
    relstr_element_smaller(esk435_0,empty_set,esk436_0),
    inference(spm,[status(thm)],[c_0_2677,c_0_2678]) ).

cnf(c_0_2682,negated_conjecture,
    ( in(esk109_3(esk435_0,X1,esk436_0),X1)
    | relstr_set_smaller(esk435_0,X1,esk436_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2679,c_0_2675]),c_0_2676])]) ).

cnf(c_0_2683,negated_conjecture,
    ~ relstr_set_smaller(esk435_0,empty_set,esk436_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_2680,c_0_2681])]) ).

cnf(c_0_2684,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2677,c_0_2682]),c_0_2683]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU355+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n003.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 Jun 19 15:10:15 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.50  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.50  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.50  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 5.74/3.19  # ENIGMATIC: Solved by autoschedule-lgb:
% 5.74/3.19  # No SInE strategy applied
% 5.74/3.19  # Trying AutoSched0 for 150 seconds
% 5.74/3.19  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 5.74/3.19  # and selection function SelectComplexExceptUniqMaxHorn.
% 5.74/3.19  #
% 5.74/3.19  # Preprocessing time       : 0.017 s
% 5.74/3.19  # Presaturation interreduction done
% 5.74/3.19  
% 5.74/3.19  # Proof found!
% 5.74/3.19  # SZS status Theorem
% 5.74/3.19  # SZS output start CNFRefutation
% See solution above
% 5.74/3.19  # Training examples: 0 positive, 0 negative
% 5.74/3.19  
% 5.74/3.19  # -------------------------------------------------
% 5.74/3.19  # User time                : 0.043 s
% 5.74/3.19  # System time              : 0.007 s
% 5.74/3.19  # Total time               : 0.050 s
% 5.74/3.19  # Maximum resident set size: 7124 pages
% 5.74/3.19  
%------------------------------------------------------------------------------