TSTP Solution File: ITP019+5 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : ITP019+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n028.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 : Sat Jul 16 22:34:19 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1578,plain,
    ( ap(c_2Ecomplex_2Ecomplex__inv,ap(c_2Ecomplex_2Ecomplex__inv,X1)) = X1
    | ~ mem(X1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v08mic90/lgb.p',i_0_1578) ).

cnf(i_0_1584,negated_conjecture,
    mem(esk183_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v08mic90/lgb.p',i_0_1584) ).

cnf(i_0_1582,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__inv,esk183_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v08mic90/lgb.p',i_0_1582) ).

cnf(i_0_1574,plain,
    ap(c_2Ecomplex_2Ecomplex__inv,ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v08mic90/lgb.p',i_0_1574) ).

cnf(i_0_1583,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) != esk183_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-v08mic90/lgb.p',i_0_1583) ).

cnf(c_0_1590,plain,
    ( ap(c_2Ecomplex_2Ecomplex__inv,ap(c_2Ecomplex_2Ecomplex__inv,X1)) = X1
    | ~ mem(X1,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)) ),
    i_0_1578 ).

cnf(c_0_1591,negated_conjecture,
    mem(esk183_0,ty_2Epair_2Eprod(ty_2Erealax_2Ereal,ty_2Erealax_2Ereal)),
    i_0_1584 ).

cnf(c_0_1592,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__inv,esk183_0) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    i_0_1582 ).

cnf(c_0_1593,plain,
    ap(c_2Ecomplex_2Ecomplex__inv,ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0)) = ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0),
    i_0_1574 ).

cnf(c_0_1594,negated_conjecture,
    ap(c_2Ecomplex_2Ecomplex__of__num,c_2Enum_2E0) != esk183_0,
    i_0_1583 ).

cnf(c_0_1595,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1590,c_0_1591]),c_0_1592]),c_0_1593]),c_0_1594]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : ITP019+5 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.08/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.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 : Sat Jun  4 02:01:17 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 1.26/1.44  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.26/1.44  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 1.26/1.44  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 1.26/1.44  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 12.00/5.86  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.00/5.86  # No SInE strategy applied
% 12.00/5.86  # Trying AutoSched0 for 149 seconds
% 12.00/5.86  # AutoSched0-Mode selected heuristic G_E___100_C18_F1_PI_AE_Q4_CS_SP_S0Y
% 12.00/5.86  # and selection function SelectMaxLComplexAvoidPosPred.
% 12.00/5.86  #
% 12.00/5.86  # Preprocessing time       : 0.042 s
% 12.00/5.86  
% 12.00/5.86  # Proof found!
% 12.00/5.86  # SZS status Theorem
% 12.00/5.86  # SZS output start CNFRefutation
% See solution above
% 12.00/5.86  # Training examples: 0 positive, 0 negative
% 12.00/5.86  
% 12.00/5.86  # -------------------------------------------------
% 12.00/5.86  # User time                : 0.059 s
% 12.00/5.86  # System time              : 0.007 s
% 12.00/5.86  # Total time               : 0.066 s
% 12.00/5.86  # Maximum resident set size: 7124 pages
% 12.00/5.86  
%------------------------------------------------------------------------------