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

View Problem - Process Solution

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

% Computer : n015.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:10 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_61,plain,
    ( apply(X1,X2) = apply(X3,X2)
    | X1 != relation_rng_restriction(X4,X3)
    | ~ relation(X3)
    | ~ relation(X1)
    | ~ function(X3)
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_61) ).

cnf(i_0_26,plain,
    ( relation(relation_rng_restriction(X1,X2))
    | ~ relation(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_26) ).

cnf(i_0_27,plain,
    ( function(relation_rng_restriction(X1,X2))
    | ~ relation(X2)
    | ~ function(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_27) ).

cnf(i_0_52,negated_conjecture,
    in(esk13_0,relation_dom(relation_rng_restriction(esk12_0,esk14_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_52) ).

cnf(i_0_53,negated_conjecture,
    function(esk14_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_53) ).

cnf(i_0_54,negated_conjecture,
    relation(esk14_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_54) ).

cnf(i_0_51,negated_conjecture,
    apply(relation_rng_restriction(esk12_0,esk14_0),esk13_0) != apply(esk14_0,esk13_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_wwwf0rh/lgb.p',i_0_51) ).

cnf(c_0_69,plain,
    ( apply(X1,X2) = apply(X3,X2)
    | X1 != relation_rng_restriction(X4,X3)
    | ~ relation(X3)
    | ~ relation(X1)
    | ~ function(X3)
    | ~ function(X1)
    | ~ in(X2,relation_dom(X1)) ),
    i_0_61 ).

cnf(c_0_70,plain,
    ( relation(relation_rng_restriction(X1,X2))
    | ~ relation(X2) ),
    i_0_26 ).

cnf(c_0_71,plain,
    ( function(relation_rng_restriction(X1,X2))
    | ~ relation(X2)
    | ~ function(X2) ),
    i_0_27 ).

cnf(c_0_72,plain,
    ( apply(relation_rng_restriction(X1,X2),X3) = apply(X2,X3)
    | ~ function(X2)
    | ~ relation(X2)
    | ~ in(X3,relation_dom(relation_rng_restriction(X1,X2))) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_69]),c_0_70]),c_0_71]) ).

cnf(c_0_73,negated_conjecture,
    in(esk13_0,relation_dom(relation_rng_restriction(esk12_0,esk14_0))),
    i_0_52 ).

cnf(c_0_74,negated_conjecture,
    function(esk14_0),
    i_0_53 ).

cnf(c_0_75,negated_conjecture,
    relation(esk14_0),
    i_0_54 ).

cnf(c_0_76,negated_conjecture,
    apply(relation_rng_restriction(esk12_0,esk14_0),esk13_0) != apply(esk14_0,esk13_0),
    i_0_51 ).

cnf(c_0_77,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_75])]),c_0_76]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : SEU045+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sun Jun 19 20:44:16 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected complete mode:
% 8.27/2.53  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.27/2.53  # No SInE strategy applied
% 8.27/2.53  # Trying AutoSched0 for 150 seconds
% 8.27/2.53  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.27/2.53  # and selection function SelectComplexExceptUniqMaxHorn.
% 8.27/2.53  #
% 8.27/2.53  # Preprocessing time       : 0.023 s
% 8.27/2.53  # Presaturation interreduction done
% 8.27/2.53  
% 8.27/2.53  # Proof found!
% 8.27/2.53  # SZS status Theorem
% 8.27/2.53  # SZS output start CNFRefutation
% See solution above
% 8.27/2.53  # Training examples: 0 positive, 0 negative
% 8.27/2.53  
% 8.27/2.53  # -------------------------------------------------
% 8.27/2.53  # User time                : 0.025 s
% 8.27/2.53  # System time              : 0.009 s
% 8.27/2.53  # Total time               : 0.034 s
% 8.27/2.53  # Maximum resident set size: 7120 pages
% 8.27/2.53  
%------------------------------------------------------------------------------