↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n011.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 20:15:09 EDT 2022

% Result   : Theorem 6.99s 2.20s
% Output   : CNFRefutation 6.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   6 unt;   0 def)
%            Number of atoms       :   51 (   8 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   61 (  19   ~;  16   |;  18   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ neq(X2,nil)
                    | ~ frontsegP(X4,X3)
                    | ~ equalelemsP(X3)
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X3,X5)
                        & frontsegP(X4,X5)
                        & segmentP(X5,X3)
                        & equalelemsP(X5) )
                    | frontsegP(X2,X1) ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ neq(X2,nil)
                      | ~ frontsegP(X4,X3)
                      | ~ equalelemsP(X3)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X3,X5)
                          & frontsegP(X4,X5)
                          & segmentP(X5,X3)
                          & equalelemsP(X5) )
                      | frontsegP(X2,X1) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_2,negated_conjecture,
    ! [X255] :
      ( ssList(esk48_0)
      & ssList(esk49_0)
      & ssList(esk50_0)
      & ssList(esk51_0)
      & esk49_0 = esk51_0
      & esk48_0 = esk50_0
      & neq(esk49_0,nil)
      & frontsegP(esk51_0,esk50_0)
      & equalelemsP(esk50_0)
      & ( ~ ssList(X255)
        | ~ neq(esk50_0,X255)
        | ~ frontsegP(esk51_0,X255)
        | ~ segmentP(X255,esk50_0)
        | ~ equalelemsP(X255) )
      & ~ frontsegP(esk49_0,esk48_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ frontsegP(esk49_0,esk48_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    esk49_0 = esk51_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    esk48_0 = esk50_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    frontsegP(esk51_0,esk50_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ~ frontsegP(esk51_0,esk50_0),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_6,c_0_7]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC350+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n011.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 : Sun Jun 12 02:03:04 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected SinE mode:
% 0.19/0.46  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 6.99/2.20  # ENIGMATIC: Solved by autoschedule:
% 6.99/2.20  # No SInE strategy applied
% 6.99/2.20  # Trying AutoSched0 for 150 seconds
% 6.99/2.20  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 6.99/2.20  # and selection function SelectNewComplexAHP.
% 6.99/2.20  #
% 6.99/2.20  # Preprocessing time       : 0.018 s
% 6.99/2.20  # Presaturation interreduction done
% 6.99/2.20  
% 6.99/2.20  # Proof found!
% 6.99/2.20  # SZS status Theorem
% 6.99/2.20  # SZS output start CNFRefutation
% See solution above
% 6.99/2.20  # Training examples: 0 positive, 0 negative
% 6.99/2.20  
% 6.99/2.20  # -------------------------------------------------
% 6.99/2.20  # User time                : 0.020 s
% 6.99/2.20  # System time              : 0.005 s
% 6.99/2.20  # Total time               : 0.025 s
% 6.99/2.20  # Maximum resident set size: 7124 pages
% 6.99/2.20  
%------------------------------------------------------------------------------