↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n009.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 : Fri Jul 15 01:07:23 EDT 2022

% Result   : Theorem 8.20s 2.50s
% Output   : CNFRefutation 8.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  12 unt;   2 nHn;  17 RR)
%            Number of literals    :   38 (  21 equ;  25 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   47 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_146,negated_conjecture,
    ~ vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(esk36_0,esk37_0,esk38_0)),esk39_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_146) ).

cnf(i_0_149,negated_conjecture,
    esk36_0 = esk34_0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_149) ).

cnf(i_0_114,plain,
    ( X1 = vabs(X2,X3,X4)
    | X5 != X6
    | X7 != X2
    | X8 != X7
    | X1 != vsubst(X8,X5,X9)
    | X9 != vabs(X2,X3,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_114) ).

cnf(i_0_147,negated_conjecture,
    vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(esk36_0,esk37_0,esk38_0),esk39_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_147) ).

cnf(i_0_36,plain,
    ( X1 != X2
    | X3 != X1
    | X4 != vabs(X3,X5,X6)
    | ~ visFreeVar(X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_36) ).

cnf(i_0_145,plain,
    ( visFreeVar(X1,X2)
    | vtcheck(X3,X2,X4)
    | ~ vtcheck(vbind(X1,X5,X3),X2,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g9m2ne4b/lgb.p',i_0_145) ).

cnf(c_0_156,negated_conjecture,
    ~ vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(esk36_0,esk37_0,esk38_0)),esk39_0),
    i_0_146 ).

cnf(c_0_157,negated_conjecture,
    esk36_0 = esk34_0,
    i_0_149 ).

cnf(c_0_158,plain,
    ( X1 = vabs(X2,X3,X4)
    | X5 != X6
    | X7 != X2
    | X8 != X7
    | X1 != vsubst(X8,X5,X9)
    | X9 != vabs(X2,X3,X4) ),
    i_0_114 ).

cnf(c_0_159,negated_conjecture,
    vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(esk36_0,esk37_0,esk38_0),esk39_0),
    i_0_147 ).

cnf(c_0_160,negated_conjecture,
    ~ vtcheck(esk33_0,vsubst(esk34_0,esk35_0,vabs(esk34_0,esk37_0,esk38_0)),esk39_0),
    inference(rw,[status(thm)],[c_0_156,c_0_157]) ).

cnf(c_0_161,plain,
    vsubst(X1,X2,vabs(X1,X3,X4)) = vabs(X1,X3,X4),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_158])])])])]) ).

cnf(c_0_162,plain,
    ( X1 != X2
    | X3 != X1
    | X4 != vabs(X3,X5,X6)
    | ~ visFreeVar(X2,X4) ),
    i_0_36 ).

cnf(c_0_163,plain,
    ( visFreeVar(X1,X2)
    | vtcheck(X3,X2,X4)
    | ~ vtcheck(vbind(X1,X5,X3),X2,X4) ),
    i_0_145 ).

cnf(c_0_164,negated_conjecture,
    vtcheck(vbind(esk34_0,esk32_0,esk33_0),vabs(esk34_0,esk37_0,esk38_0),esk39_0),
    inference(rw,[status(thm)],[c_0_159,c_0_157]) ).

cnf(c_0_165,negated_conjecture,
    ~ vtcheck(esk33_0,vabs(esk34_0,esk37_0,esk38_0),esk39_0),
    inference(rw,[status(thm)],[c_0_160,c_0_161]) ).

cnf(c_0_166,plain,
    ~ visFreeVar(X1,vabs(X1,X2,X3)),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_162])])]) ).

cnf(c_0_167,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_164]),c_0_165]),c_0_166]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COM130+1 : TPTP v8.1.0. Released v6.4.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n009.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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 : Thu Jun 16 18:43:39 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.20/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.20/2.50  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.20/2.50  # No SInE strategy applied
% 8.20/2.50  # Trying AutoSched0 for 150 seconds
% 8.20/2.50  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S03DN
% 8.20/2.50  # and selection function PSelectComplexExceptRRHorn.
% 8.20/2.50  #
% 8.20/2.50  # Preprocessing time       : 0.013 s
% 8.20/2.50  # Presaturation interreduction done
% 8.20/2.50  
% 8.20/2.50  # Proof found!
% 8.20/2.50  # SZS status Theorem
% 8.20/2.50  # SZS output start CNFRefutation
% See solution above
% 8.20/2.50  # Training examples: 0 positive, 0 negative
% 8.20/2.50  
% 8.20/2.50  # -------------------------------------------------
% 8.20/2.50  # User time                : 0.013 s
% 8.20/2.50  # System time              : 0.004 s
% 8.20/2.50  # Total time               : 0.017 s
% 8.20/2.50  # Maximum resident set size: 7124 pages
% 8.20/2.50  
%------------------------------------------------------------------------------