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

View Problem - Process Solution

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

% Computer : n021.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:40 EDT 2022

% Result   : Theorem 40.67s 7.26s
% Output   : CNFRefutation 40.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   38 (  16 unt;  20 nHn;  36 RR)
%            Number of literals    :  174 (   0 equ; 106 neg)
%            Maximal clause size   :   11 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-3 aty)
%            Number of variables   :   70 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_204,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X1,X2,X3)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ element(X4,the_carrier(X2))
    | ~ in(apply_netmap(X1,X2,X4),X3)
    | ~ related(X2,esk14_3(X1,X2,X3),X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_204) ).

cnf(i_0_536,plain,
    ( empty_carrier(X1)
    | related(X1,X2,esk99_3(X1,X3,X2))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_536) ).

cnf(i_0_185,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | in(apply_netmap(X1,X2,X3),X4)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ is_eventually_in(X1,X2,X4)
    | ~ element(X3,the_carrier(X2))
    | ~ related(X2,esk6_3(X1,X2,X4),X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_185) ).

cnf(i_0_537,plain,
    ( empty_carrier(X1)
    | related(X1,X2,esk99_3(X1,X2,X3))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_537) ).

cnf(i_0_538,plain,
    ( empty_carrier(X1)
    | element(esk99_3(X1,X2,X3),the_carrier(X1))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_538) ).

cnf(i_0_186,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | element(esk6_3(X2,X1,X3),the_carrier(X1))
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2)
    | ~ is_eventually_in(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_186) ).

cnf(i_0_205,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X2,X1,X3)
    | element(esk14_3(X2,X1,X3),the_carrier(X1))
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_205) ).

cnf(i_0_744,plain,
    ( rel_str(X1)
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_744) ).

cnf(i_0_2988,negated_conjecture,
    net_str(esk474_0,esk473_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2988) ).

cnf(i_0_2992,negated_conjecture,
    one_sorted_str(esk473_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2992) ).

cnf(i_0_2986,negated_conjecture,
    ~ is_often_in(esk473_0,esk474_0,esk475_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2986) ).

cnf(i_0_2987,negated_conjecture,
    is_eventually_in(esk473_0,esk474_0,esk475_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2987) ).

cnf(i_0_2989,negated_conjecture,
    directed_relstr(esk474_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2989) ).

cnf(i_0_2991,negated_conjecture,
    ~ empty_carrier(esk474_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2991) ).

cnf(i_0_2993,negated_conjecture,
    ~ empty_carrier(esk473_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lgmmes3x/input.p',i_0_2993) ).

cnf(c_0_3009,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X1,X2,X3)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ element(X4,the_carrier(X2))
    | ~ in(apply_netmap(X1,X2,X4),X3)
    | ~ related(X2,esk14_3(X1,X2,X3),X4) ),
    i_0_204 ).

cnf(c_0_3010,plain,
    ( empty_carrier(X1)
    | related(X1,X2,esk99_3(X1,X3,X2))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    i_0_536 ).

cnf(c_0_3011,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | in(apply_netmap(X1,X2,X3),X4)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ is_eventually_in(X1,X2,X4)
    | ~ element(X3,the_carrier(X2))
    | ~ related(X2,esk6_3(X1,X2,X4),X3) ),
    i_0_185 ).

cnf(c_0_3012,plain,
    ( empty_carrier(X1)
    | related(X1,X2,esk99_3(X1,X2,X3))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    i_0_537 ).

cnf(c_0_3013,plain,
    ( is_often_in(X1,X2,X3)
    | empty_carrier(X2)
    | empty_carrier(X1)
    | ~ element(esk99_3(X2,X4,esk14_3(X1,X2,X3)),the_carrier(X2))
    | ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
    | ~ element(X4,the_carrier(X2))
    | ~ in(apply_netmap(X1,X2,esk99_3(X2,X4,esk14_3(X1,X2,X3))),X3)
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ one_sorted_str(X1)
    | ~ rel_str(X2) ),
    inference(spm,[status(thm)],[c_0_3009,c_0_3010]) ).

cnf(c_0_3014,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | in(apply_netmap(X2,X1,esk99_3(X1,esk6_3(X2,X1,X3),X4)),X3)
    | ~ is_eventually_in(X2,X1,X3)
    | ~ element(esk99_3(X1,esk6_3(X2,X1,X3),X4),the_carrier(X1))
    | ~ element(esk6_3(X2,X1,X3),the_carrier(X1))
    | ~ element(X4,the_carrier(X1))
    | ~ net_str(X1,X2)
    | ~ directed_relstr(X1)
    | ~ one_sorted_str(X2)
    | ~ rel_str(X1) ),
    inference(spm,[status(thm)],[c_0_3011,c_0_3012]) ).

cnf(c_0_3015,plain,
    ( is_often_in(X1,X2,X3)
    | empty_carrier(X2)
    | empty_carrier(X1)
    | ~ is_eventually_in(X1,X2,X3)
    | ~ element(esk99_3(X2,esk6_3(X1,X2,X3),esk14_3(X1,X2,X3)),the_carrier(X2))
    | ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
    | ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ one_sorted_str(X1)
    | ~ rel_str(X2) ),
    inference(spm,[status(thm)],[c_0_3013,c_0_3014]) ).

cnf(c_0_3016,plain,
    ( empty_carrier(X1)
    | element(esk99_3(X1,X2,X3),the_carrier(X1))
    | ~ rel_str(X1)
    | ~ directed_relstr(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1)) ),
    i_0_538 ).

cnf(c_0_3017,plain,
    ( is_often_in(X1,X2,X3)
    | empty_carrier(X2)
    | empty_carrier(X1)
    | ~ is_eventually_in(X1,X2,X3)
    | ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
    | ~ element(esk6_3(X1,X2,X3),the_carrier(X2))
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ one_sorted_str(X1)
    | ~ rel_str(X2) ),
    inference(spm,[status(thm)],[c_0_3015,c_0_3016]) ).

cnf(c_0_3018,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | element(esk6_3(X2,X1,X3),the_carrier(X1))
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2)
    | ~ is_eventually_in(X2,X1,X3) ),
    i_0_186 ).

cnf(c_0_3019,plain,
    ( is_often_in(X1,X2,X3)
    | empty_carrier(X2)
    | empty_carrier(X1)
    | ~ is_eventually_in(X1,X2,X3)
    | ~ element(esk14_3(X1,X2,X3),the_carrier(X2))
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ one_sorted_str(X1)
    | ~ rel_str(X2) ),
    inference(spm,[status(thm)],[c_0_3017,c_0_3018]) ).

cnf(c_0_3020,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X2,X1,X3)
    | element(esk14_3(X2,X1,X3),the_carrier(X1))
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2) ),
    i_0_205 ).

cnf(c_0_3021,plain,
    ( rel_str(X1)
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2) ),
    i_0_744 ).

cnf(c_0_3022,negated_conjecture,
    net_str(esk474_0,esk473_0),
    i_0_2988 ).

cnf(c_0_3023,negated_conjecture,
    one_sorted_str(esk473_0),
    i_0_2992 ).

cnf(c_0_3024,negated_conjecture,
    ~ is_often_in(esk473_0,esk474_0,esk475_0),
    i_0_2986 ).

cnf(c_0_3025,plain,
    ( is_often_in(X1,X2,X3)
    | empty_carrier(X2)
    | empty_carrier(X1)
    | ~ is_eventually_in(X1,X2,X3)
    | ~ net_str(X2,X1)
    | ~ directed_relstr(X2)
    | ~ one_sorted_str(X1)
    | ~ rel_str(X2) ),
    inference(spm,[status(thm)],[c_0_3019,c_0_3020]) ).

cnf(c_0_3026,negated_conjecture,
    is_eventually_in(esk473_0,esk474_0,esk475_0),
    i_0_2987 ).

cnf(c_0_3027,negated_conjecture,
    directed_relstr(esk474_0),
    i_0_2989 ).

cnf(c_0_3028,negated_conjecture,
    rel_str(esk474_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3021,c_0_3022]),c_0_3023])]) ).

cnf(c_0_3029,negated_conjecture,
    ~ empty_carrier(esk474_0),
    i_0_2991 ).

cnf(c_0_3030,negated_conjecture,
    ~ empty_carrier(esk473_0),
    i_0_2993 ).

cnf(c_0_3031,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3024,c_0_3025]),c_0_3026]),c_0_3022]),c_0_3027]),c_0_3023]),c_0_3028])]),c_0_3029]),c_0_3030]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU376+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n021.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 06:51:34 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.50  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.50  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.50  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.50  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 40.67/7.26  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 40.67/7.26  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 35; version: 991; iters: 150)
% 40.67/7.26  # Preprocessing time       : 2.340 s
% 40.67/7.26  # Presaturation interreduction done
% 40.67/7.26  
% 40.67/7.26  # Proof found!
% 40.67/7.26  # SZS status Theorem
% 40.67/7.26  # SZS output start CNFRefutation
% See solution above
% 40.67/7.26  # Training examples: 0 positive, 0 negative
% 40.67/7.26  
% 40.67/7.26  # -------------------------------------------------
% 40.67/7.26  # User time                : 3.871 s
% 40.67/7.26  # System time              : 0.166 s
% 40.67/7.26  # Total time               : 4.037 s
% 40.67/7.26  # ...preprocessing         : 2.340 s
% 40.67/7.26  # ...main loop             : 1.696 s
% 40.67/7.26  # Maximum resident set size: 195392 pages
% 40.67/7.26  
%------------------------------------------------------------------------------