↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n019.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 13:53:15 EDT 2022

% Result   : Theorem 75.54s 12.25s
% Output   : CNFRefutation 75.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   35 (   7 unt;   0 def)
%            Number of atoms       :   96 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  101 (  40   ~;  34   |;  16   &)
%                                         (   9 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   2 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   32 (   2 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(addAssertion,conjecture,
    ! [X2] :
      ( reachableState(X2)
     => v4(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssertion) ).

fof(addAssignment_8257,axiom,
    ! [X2] :
      ( v22292(X2,bitIndex0)
    <=> v22293(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_8257) ).

fof(writeBinaryOperatorShiftedRanges_1475,axiom,
    ! [X2] :
      ( v22314(X2)
    <=> ( v22292(X2,bitIndex0)
        | v22292(X2,bitIndex1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1475) ).

fof(writeBinaryOperatorShiftedRanges_1473,axiom,
    ! [X2] :
      ( v22293(X2)
    <=> ( v22295(X2)
        & v22296(X2,bitIndex9) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1473) ).

fof(writeBinaryOperatorShiftedRanges_1474,axiom,
    ! [X2] :
      ( v22291(X2)
    <=> ( v22292(X2,bitIndex0)
        & v22292(X2,bitIndex1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1474) ).

fof(writeBinaryOperatorEqualRangesSingleBits_5375,axiom,
    ! [X2] :
      ( v22288(X2)
    <=> ( v22290(X2)
        & v22314(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_5375) ).

fof(writeUnaryOperator_2751,axiom,
    ! [X2] :
      ( ~ v22290(X2)
    <=> v22291(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_2751) ).

fof(writeUnaryOperator_2753,axiom,
    ! [X2] :
      ( ~ v4(X2)
    <=> v22287(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_2753) ).

fof(writeUnaryOperator_2752,axiom,
    ! [X2] :
      ( ~ v22287(X2)
    <=> v22288(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_2752) ).

fof(addZeroExtensionConstraint_8,axiom,
    ! [X2] : ~ v22296(X2,bitIndex9),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_8) ).

fof(addAssignment_8256,axiom,
    ! [X2] :
      ( v22292(X2,bitIndex1)
    <=> $true ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_8256) ).

fof(c_0_11,negated_conjecture,
    ~ ! [X2] :
        ( reachableState(X2)
       => v4(X2) ),
    inference(assume_negation,[status(cth)],[addAssertion]) ).

fof(c_0_12,plain,
    ! [X168] :
      ( ( ~ v22292(X168,bitIndex0)
        | v22293(X168) )
      & ( ~ v22293(X168)
        | v22292(X168,bitIndex0) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_8257])]) ).

fof(c_0_13,plain,
    ! [X165] :
      ( ( ~ v22314(X165)
        | v22292(X165,bitIndex0)
        | v22292(X165,bitIndex1) )
      & ( ~ v22292(X165,bitIndex0)
        | v22314(X165) )
      & ( ~ v22292(X165,bitIndex1)
        | v22314(X165) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1475])])]) ).

fof(c_0_14,plain,
    ! [X170] :
      ( ( v22295(X170)
        | ~ v22293(X170) )
      & ( v22296(X170,bitIndex9)
        | ~ v22293(X170) )
      & ( ~ v22295(X170)
        | ~ v22296(X170,bitIndex9)
        | v22293(X170) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1473])])]) ).

fof(c_0_15,plain,
    ! [X167] :
      ( ( v22292(X167,bitIndex0)
        | ~ v22291(X167) )
      & ( v22292(X167,bitIndex1)
        | ~ v22291(X167) )
      & ( ~ v22292(X167,bitIndex0)
        | ~ v22292(X167,bitIndex1)
        | v22291(X167) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1474])])]) ).

fof(c_0_16,plain,
    ! [X164] :
      ( ( v22290(X164)
        | ~ v22288(X164) )
      & ( v22314(X164)
        | ~ v22288(X164) )
      & ( ~ v22290(X164)
        | ~ v22314(X164)
        | v22288(X164) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_5375])])]) ).

fof(c_0_17,plain,
    ! [X166] :
      ( ( v22290(X166)
        | v22291(X166) )
      & ( ~ v22291(X166)
        | ~ v22290(X166) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_2751])])]) ).

fof(c_0_18,plain,
    ! [X162] :
      ( ( v4(X162)
        | v22287(X162) )
      & ( ~ v22287(X162)
        | ~ v4(X162) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_2753])])]) ).

fof(c_0_19,plain,
    ! [X163] :
      ( ( v22287(X163)
        | v22288(X163) )
      & ( ~ v22288(X163)
        | ~ v22287(X163) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_2752])])]) ).

fof(c_0_20,plain,
    ! [X194] : ~ v22296(X194,bitIndex9),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_8])]) ).

fof(c_0_21,negated_conjecture,
    ( reachableState(esk1_0)
    & ~ v4(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).

fof(c_0_22,plain,
    ! [X169] : v22292(X169,bitIndex1),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addAssignment_8256])]) ).

cnf(c_0_23,plain,
    ( v22293(X1)
    | ~ v22292(X1,bitIndex0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_24,plain,
    ( v22314(X1)
    | ~ v22292(X1,bitIndex1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_25,plain,
    ( v22296(X1,bitIndex9)
    | ~ v22293(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_26,plain,
    ( v22292(X1,bitIndex0)
    | ~ v22291(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_27,plain,
    ( v22288(X1)
    | ~ v22290(X1)
    | ~ v22314(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_28,plain,
    ( v22290(X1)
    | v22291(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_29,plain,
    ( v4(X1)
    | v22287(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_30,plain,
    ( ~ v22288(X1)
    | ~ v22287(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_31,plain,
    ~ v22296(X1,bitIndex9),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_32,negated_conjecture,
    ~ v4(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_33,plain,
    v22292(X1,bitIndex1),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_34,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_23,c_0_24,c_0_25,c_0_26,c_0_27,c_0_28,c_0_29,c_0_30,c_0_31,c_0_32,c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : HWV091+1 : TPTP v8.1.0. Released v6.1.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n019.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 : Fri Jun 17 07:18:41 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.38/0.60  # ENIGMATIC: Selected SinE mode:
% 0.43/1.05  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.43/1.05  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.43/1.05  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.43/1.05  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 75.54/12.25  # ENIGMATIC: Solved by autoschedule:
% 75.54/12.25  # No SInE strategy applied
% 75.54/12.25  # Trying AutoSched0 for 149 seconds
% 75.54/12.25  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 75.54/12.25  # and selection function SelectNewComplexAHP.
% 75.54/12.25  #
% 75.54/12.25  # Preprocessing time       : 7.486 s
% 75.54/12.25  # SatCheck found unsatisfiable ground set
% 75.54/12.25  # Presaturation interreduction done
% 75.54/12.25  
% 75.54/12.25  # Proof found!
% 75.54/12.25  # SZS status Theorem
% 75.54/12.25  # SZS output start CNFRefutation
% See solution above
% 75.54/12.25  # Training examples: 0 positive, 0 negative
% 75.54/12.25  
% 75.54/12.25  # -------------------------------------------------
% 75.54/12.25  # User time                : 8.063 s
% 75.54/12.25  # System time              : 0.250 s
% 75.54/12.25  # Total time               : 8.314 s
% 75.54/12.25  # Maximum resident set size: 35264 pages
% 75.54/12.25  
%------------------------------------------------------------------------------