↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWW288+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n020.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 : Thu Jul 21 00:01:54 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_220,plain,
    ( c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) = v_p
    | ~ class_Int_Oring__char__0(t_a)
    | ~ class_Rings_Oidom(t_a) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_220) ).

cnf(i_0_1670,hypothesis,
    class_Int_Oring__char__0(t_a),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_1670) ).

cnf(i_0_1671,hypothesis,
    class_Rings_Oidom(t_a),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_1671) ).

cnf(i_0_415,plain,
    ( c_Polynomial_Odegree(X1,c_Polynomial_OpCons(X1,X2,X3)) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat)
    | X3 != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_Groups_Ozero(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_415) ).

cnf(i_0_217,negated_conjecture,
    c_Polynomial_Odegree(t_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_217) ).

cnf(i_0_177,plain,
    ( class_Groups_Ozero(X1)
    | ~ class_Int_Oring__char__0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mhymjf17/lgb.p',i_0_177) ).

cnf(c_0_1678,plain,
    ( c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) = v_p
    | ~ class_Int_Oring__char__0(t_a)
    | ~ class_Rings_Oidom(t_a) ),
    i_0_220 ).

cnf(c_0_1679,hypothesis,
    class_Int_Oring__char__0(t_a),
    i_0_1670 ).

cnf(c_0_1680,hypothesis,
    class_Rings_Oidom(t_a),
    i_0_1671 ).

cnf(c_0_1681,plain,
    ( c_Polynomial_Odegree(X1,c_Polynomial_OpCons(X1,X2,X3)) = c_Groups_Ozero__class_Ozero(tc_Nat_Onat)
    | X3 != c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(X1))
    | ~ class_Groups_Ozero(X1) ),
    i_0_415 ).

cnf(c_0_1682,plain,
    c_Polynomial_OpCons(t_a,hAPP(c_Polynomial_Opoly(t_a,v_p),c_Groups_Ozero__class_Ozero(t_a)),c_Groups_Ozero__class_Ozero(tc_Polynomial_Opoly(t_a))) = v_p,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1678,c_0_1679]),c_0_1680])]) ).

cnf(c_0_1683,negated_conjecture,
    c_Polynomial_Odegree(t_a,v_p) != c_Groups_Ozero__class_Ozero(tc_Nat_Onat),
    i_0_217 ).

cnf(c_0_1684,plain,
    ~ class_Groups_Ozero(t_a),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1681,c_0_1682]),c_0_1683]) ).

cnf(c_0_1685,plain,
    ( class_Groups_Ozero(X1)
    | ~ class_Int_Oring__char__0(X1) ),
    i_0_177 ).

cnf(c_0_1686,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1684,c_0_1685]),c_0_1679])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWW288+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n020.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 : Sat Jun  4 11:26:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  # ENIGMATIC: Selected SinE mode:
% 0.19/0.52  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.52  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.52  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.52  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.08/2.73  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.08/2.73  # No SInE strategy applied
% 8.08/2.73  # Trying AutoSched0 for 150 seconds
% 8.08/2.73  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
% 8.08/2.73  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.08/2.73  #
% 8.08/2.73  # Preprocessing time       : 0.028 s
% 8.08/2.73  
% 8.08/2.73  # Proof found!
% 8.08/2.73  # SZS status Theorem
% 8.08/2.73  # SZS output start CNFRefutation
% See solution above
% 8.08/2.73  # Training examples: 0 positive, 0 negative
% 8.08/2.73  
% 8.08/2.73  # -------------------------------------------------
% 8.08/2.73  # User time                : 0.049 s
% 8.08/2.73  # System time              : 0.006 s
% 8.08/2.73  # Total time               : 0.055 s
% 8.08/2.73  # Maximum resident set size: 7392 pages
% 8.08/2.73  
%------------------------------------------------------------------------------