↑ Up

hopCoP---0.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : hopCoP---0.1
% Problem  : SWC044+1 : TPTP v9.0.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n024.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  : 300s
% DateTime : Fri Jul 25 04:11:12 PM UTC 2025

% Result   : Theorem 265.16s 33.66s
% Output   : CNFRefutation 265.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   37 (  23 unt;   0 def)
%            Number of atoms       :   86 (  23 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :   85 (  36   ~;  33   |;   1   &)
%                                         (   1 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   19 (   0 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,plain,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ! [X] :
                  ( ssList(X)
                 => ( nil != V
                    | V != X
                    | U != W
                    | ~ rearsegP(X,W)
                    | nil = U ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).

fof(co1_negated,plain,
    ~ ! [U] :
        ( ssList(U)
       => ! [V] :
            ( ssList(V)
           => ! [W] :
                ( ssList(W)
               => ! [X] :
                    ( ssList(X)
                   => ( nil != V
                      | V != X
                      | U != W
                      | ~ rearsegP(X,W)
                      | nil = U ) ) ) ) ),
    inference(negate_conjecture,[status(cth)],[co1]) ).

cnf(188,plain,
    ssList(sK55),
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l0,plain,
    ssList(sK55),
    inference(instantiation,[status(thm)],[188]) ).

fof(ax47,plain,
    ! [U] :
      ( ssList(U)
     => ! [V] :
          ( ssList(V)
         => ! [W] :
              ( ssList(W)
             => ( ( rearsegP(U,V)
                  & rearsegP(V,W) )
               => rearsegP(U,W) ) ) ) ),
    file('Axioms/SWC001+0.ax',ax47) ).

cnf(125,plain,
    ( ~ ssList(X0)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | ~ rearsegP(X0,X1)
    | ~ rearsegP(X1,X2)
    | rearsegP(X0,X2) ),
    inference(cnf,[status(esa)],[ax47]) ).

cnf(l1,plain,
    ( ~ ssList(nil)
    | ~ ssList(sK58)
    | ~ ssList(sK55)
    | ~ rearsegP(nil,sK58)
    | ~ rearsegP(sK58,sK55)
    | rearsegP(nil,sK55) ),
    inference(instantiation,[status(thm)],[125]) ).

cnf(l294,plain,
    ( ~ ssList(sK58)
    | ~ ssList(sK57)
    | ~ ssList(sK55)
    | ~ rearsegP(sK58,sK57)
    | ~ rearsegP(sK57,sK55)
    | rearsegP(sK58,sK55) ),
    inference(instantiation,[status(thm)],[125]) ).

cnf(191,plain,
    ssList(sK58),
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l2,plain,
    ssList(sK58),
    inference(instantiation,[status(thm)],[191]) ).

cnf(l299,plain,
    ssList(sK58),
    inference(instantiation,[status(thm)],[191]) ).

fof(ax52,plain,
    ! [U] :
      ( ssList(U)
     => ( rearsegP(nil,U)
      <=> nil = U ) ),
    file('Axioms/SWC001+0.ax',ax52) ).

cnf(131,plain,
    ( nil != X0
    | ~ ssList(X0)
    | rearsegP(nil,X0) ),
    inference(cnf,[status(esa)],[ax52]) ).

cnf(l131,plain,
    ( nil != sK58
    | ~ ssList(sK58)
    | rearsegP(nil,sK58) ),
    inference(instantiation,[status(thm)],[131]) ).

cnf(130,plain,
    ( ~ ssList(X0)
    | ~ rearsegP(nil,X0)
    | nil = X0 ),
    inference(cnf,[status(esa)],[ax52]) ).

cnf(l313,plain,
    ( ~ ssList(sK55)
    | ~ rearsegP(nil,sK55)
    | nil = sK55 ),
    inference(instantiation,[status(thm)],[130]) ).

cnf(193,plain,
    sK56 = sK58,
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l176,plain,
    sK56 = sK58,
    inference(instantiation,[status(thm)],[193]) ).

cnf(189,plain,
    ssList(sK56),
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l177,plain,
    ssList(sK56),
    inference(instantiation,[status(thm)],[189]) ).

cnf(192,plain,
    nil = sK56,
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l143,plain,
    nil = sK56,
    inference(instantiation,[status(thm)],[192]) ).

fof(ax49,plain,
    ! [U] :
      ( ssList(U)
     => rearsegP(U,U) ),
    file('Axioms/SWC001+0.ax',ax49) ).

cnf(127,plain,
    ( ~ ssList(X0)
    | rearsegP(X0,X0) ),
    inference(cnf,[status(esa)],[ax49]) ).

cnf(l367,plain,
    ( ~ ssList(sK55)
    | rearsegP(sK55,sK55) ),
    inference(instantiation,[status(thm)],[127]) ).

cnf(194,plain,
    sK55 = sK57,
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l365,plain,
    sK55 = sK57,
    inference(instantiation,[status(thm)],[194]) ).

cnf(195,plain,
    rearsegP(sK58,sK57),
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l343,plain,
    rearsegP(sK58,sK57),
    inference(instantiation,[status(thm)],[195]) ).

cnf(l140,plain,
    sK56 = sK58,
    inference(instantiation,[status(thm)],[193]) ).

fof(ax17,plain,
    ssList(nil),
    file('Axioms/SWC001+0.ax',ax17) ).

cnf(83,plain,
    ssList(nil),
    inference(cnf,[status(esa)],[ax17]) ).

cnf(l128,plain,
    ssList(nil),
    inference(instantiation,[status(thm)],[83]) ).

cnf(l306,plain,
    sK55 = sK57,
    inference(instantiation,[status(thm)],[194]) ).

cnf(196,plain,
    nil != sK55,
    inference(cnf,[status(esa)],[co1_negated]) ).

cnf(l314,plain,
    nil != sK55,
    inference(instantiation,[status(thm)],[196]) ).

cnf(final,plain,
    $false,
    inference(ground_refutation,[status(thm)],[l0,l1,l294,l2,l299,l131,l313,l176,l177,l143,l367,l365,l343,l140,l128,l306,l314]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWC044+1 : TPTP v9.0.0. Released v2.4.0.
% 0.14/0.13  % Command  : /export/starexec/sandbox/solver/bin/execute.py 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.35  % Computer : n024.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Tue Jul 22 04:58:49 EDT 2025
% 0.14/0.35  % CPUTime  : 
% 0.21/0.36  % launching worker at depth: 4
% 0.21/0.36  % launching worker at depth: 1
% 0.21/0.36  % launching worker at depth: 7
% 0.21/0.36  % launching worker at depth: 8
% 0.21/0.36  % launching worker at depth: 2
% 0.21/0.36  % launching worker at depth: 5
% 0.21/0.36  % launching worker at depth: 3
% 0.21/0.36  % launching worker at depth: 6
% 0.21/0.37  % launching worker at depth: 9
% 1.73/0.56  % launching worker at depth: 10
% 44.93/5.99  % launching worker at depth: 11
% 265.16/33.66  % SZS status Theorem for theBenchmark
% 265.16/33.66  % SZS output start CNFRefutation
% See solution above
%------------------------------------------------------------------------------