TSTP Solution File: SWC369+1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : SWC369+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n014.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 : Tue May 21 04:38:30 EDT 2024

% Result   : Theorem 0.73s 0.88s
% Output   : Refutation 0.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   46 (  10 unt;   0 def)
%            Number of atoms       :  230 (  71 equ)
%            Maximal formula atoms :   24 (   5 avg)
%            Number of connectives :  265 (  81   ~;  68   |;  93   &)
%                                         (   8 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   44 (  20   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f220,plain,
    $false,
    inference(avatar_sat_refutation,[],[f163,f177,f178,f206,f219]) ).

fof(f219,plain,
    ( spl6_2
    | ~ spl6_4
    | ~ spl6_5 ),
    inference(avatar_contradiction_clause,[],[f218]) ).

fof(f218,plain,
    ( $false
    | spl6_2
    | ~ spl6_4
    | ~ spl6_5 ),
    inference(subsumption_resolution,[],[f213,f179]) ).

fof(f179,plain,
    segmentP(nil,nil),
    inference(subsumption_resolution,[],[f152,f136]) ).

fof(f136,plain,
    ssList(nil),
    inference(cnf_transformation,[],[f17]) ).

fof(f17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).

fof(f152,plain,
    ( segmentP(nil,nil)
    | ~ ssList(nil) ),
    inference(equality_resolution,[],[f138]) ).

fof(f138,plain,
    ! [X0] :
      ( segmentP(nil,X0)
      | nil != X0
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f118]) ).

fof(f118,plain,
    ! [X0] :
      ( ( ( segmentP(nil,X0)
          | nil != X0 )
        & ( nil = X0
          | ~ segmentP(nil,X0) ) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f102]) ).

fof(f102,plain,
    ! [X0] :
      ( ( segmentP(nil,X0)
      <=> nil = X0 )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f58]) ).

fof(f58,axiom,
    ! [X0] :
      ( ssList(X0)
     => ( segmentP(nil,X0)
      <=> nil = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax58) ).

fof(f213,plain,
    ( ~ segmentP(nil,nil)
    | spl6_2
    | ~ spl6_4
    | ~ spl6_5 ),
    inference(backward_demodulation,[],[f209,f172]) ).

fof(f172,plain,
    ( nil = sK2
    | ~ spl6_4 ),
    inference(avatar_component_clause,[],[f170]) ).

fof(f170,plain,
    ( spl6_4
  <=> nil = sK2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_4])]) ).

fof(f209,plain,
    ( ~ segmentP(nil,sK2)
    | spl6_2
    | ~ spl6_5 ),
    inference(backward_demodulation,[],[f161,f175]) ).

fof(f175,plain,
    ( nil = sK3
    | ~ spl6_5 ),
    inference(avatar_component_clause,[],[f174]) ).

fof(f174,plain,
    ( spl6_5
  <=> nil = sK3 ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_5])]) ).

fof(f161,plain,
    ( ~ segmentP(sK3,sK2)
    | spl6_2 ),
    inference(avatar_component_clause,[],[f160]) ).

fof(f160,plain,
    ( spl6_2
  <=> segmentP(sK3,sK2) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).

fof(f206,plain,
    ( spl6_5
    | spl6_1 ),
    inference(avatar_split_clause,[],[f191,f156,f174]) ).

fof(f156,plain,
    ( spl6_1
  <=> neq(sK3,nil) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).

fof(f191,plain,
    ( nil = sK3
    | spl6_1 ),
    inference(unit_resulting_resolution,[],[f127,f136,f158,f135]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( X0 = X1
      | neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    inference(cnf_transformation,[],[f117]) ).

fof(f117,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( ( neq(X0,X1)
              | X0 = X1 )
            & ( X0 != X1
              | ~ neq(X0,X1) ) )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(nnf_transformation,[],[f101]) ).

fof(f101,plain,
    ! [X0] :
      ( ! [X1] :
          ( ( neq(X0,X1)
          <=> X0 != X1 )
          | ~ ssList(X1) )
      | ~ ssList(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,axiom,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ( neq(X0,X1)
          <=> X0 != X1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).

fof(f158,plain,
    ( ~ neq(sK3,nil)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f156]) ).

fof(f127,plain,
    ssList(sK3),
    inference(cnf_transformation,[],[f116]) ).

fof(f116,plain,
    ( ( ( segmentP(sK3,sK2)
        & neq(sK2,nil) )
      | ~ neq(sK3,nil) )
    & ( nil != sK3
      | nil = sK2 )
    & ~ segmentP(sK1,sK0)
    & sK0 = sK2
    & sK1 = sK3
    & ssList(sK3)
    & ssList(sK2)
    & ssList(sK1)
    & ssList(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f100,f115,f114,f113,f112]) ).

fof(f112,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ( ( segmentP(X3,X2)
                        & neq(X2,nil) )
                      | ~ neq(X3,nil) )
                    & ( nil != X3
                      | nil = X2 )
                    & ~ segmentP(X1,X0)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( segmentP(X3,X2)
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ segmentP(X1,sK0)
                  & sK0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f113,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ( ( segmentP(X3,X2)
                    & neq(X2,nil) )
                  | ~ neq(X3,nil) )
                & ( nil != X3
                  | nil = X2 )
                & ~ segmentP(X1,sK0)
                & sK0 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ( ( segmentP(X3,X2)
                  & neq(X2,nil) )
                | ~ neq(X3,nil) )
              & ( nil != X3
                | nil = X2 )
              & ~ segmentP(sK1,sK0)
              & sK0 = X2
              & sK1 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f114,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ( ( segmentP(X3,X2)
                & neq(X2,nil) )
              | ~ neq(X3,nil) )
            & ( nil != X3
              | nil = X2 )
            & ~ segmentP(sK1,sK0)
            & sK0 = X2
            & sK1 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ( ( segmentP(X3,sK2)
              & neq(sK2,nil) )
            | ~ neq(X3,nil) )
          & ( nil != X3
            | nil = sK2 )
          & ~ segmentP(sK1,sK0)
          & sK0 = sK2
          & sK1 = X3
          & ssList(X3) )
      & ssList(sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f115,plain,
    ( ? [X3] :
        ( ( ( segmentP(X3,sK2)
            & neq(sK2,nil) )
          | ~ neq(X3,nil) )
        & ( nil != X3
          | nil = sK2 )
        & ~ segmentP(sK1,sK0)
        & sK0 = sK2
        & sK1 = X3
        & ssList(X3) )
   => ( ( ( segmentP(sK3,sK2)
          & neq(sK2,nil) )
        | ~ neq(sK3,nil) )
      & ( nil != sK3
        | nil = sK2 )
      & ~ segmentP(sK1,sK0)
      & sK0 = sK2
      & sK1 = sK3
      & ssList(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f100,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( segmentP(X3,X2)
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ segmentP(X1,X0)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f99]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ( ( segmentP(X3,X2)
                      & neq(X2,nil) )
                    | ~ neq(X3,nil) )
                  & ( nil != X3
                    | nil = X2 )
                  & ~ segmentP(X1,X0)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(ennf_transformation,[],[f97]) ).

fof(f97,negated_conjecture,
    ~ ! [X0] :
        ( ssList(X0)
       => ! [X1] :
            ( ssList(X1)
           => ! [X2] :
                ( ssList(X2)
               => ! [X3] :
                    ( ssList(X3)
                   => ( ( ( ~ segmentP(X3,X2)
                          | ~ neq(X2,nil) )
                        & neq(X3,nil) )
                      | ( nil = X3
                        & nil != X2 )
                      | segmentP(X1,X0)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

fof(f96,conjecture,
    ! [X0] :
      ( ssList(X0)
     => ! [X1] :
          ( ssList(X1)
         => ! [X2] :
              ( ssList(X2)
             => ! [X3] :
                  ( ssList(X3)
                 => ( ( ( ~ segmentP(X3,X2)
                        | ~ neq(X2,nil) )
                      & neq(X3,nil) )
                    | ( nil = X3
                      & nil != X2 )
                    | segmentP(X1,X0)
                    | X0 != X2
                    | X1 != X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f178,plain,
    ~ spl6_2,
    inference(avatar_split_clause,[],[f148,f160]) ).

fof(f148,plain,
    ~ segmentP(sK3,sK2),
    inference(definition_unfolding,[],[f130,f128,f129]) ).

fof(f129,plain,
    sK0 = sK2,
    inference(cnf_transformation,[],[f116]) ).

fof(f128,plain,
    sK1 = sK3,
    inference(cnf_transformation,[],[f116]) ).

fof(f130,plain,
    ~ segmentP(sK1,sK0),
    inference(cnf_transformation,[],[f116]) ).

fof(f177,plain,
    ( spl6_4
    | ~ spl6_5 ),
    inference(avatar_split_clause,[],[f131,f174,f170]) ).

fof(f131,plain,
    ( nil != sK3
    | nil = sK2 ),
    inference(cnf_transformation,[],[f116]) ).

fof(f163,plain,
    ( ~ spl6_1
    | spl6_2 ),
    inference(avatar_split_clause,[],[f133,f160,f156]) ).

fof(f133,plain,
    ( segmentP(sK3,sK2)
    | ~ neq(sK3,nil) ),
    inference(cnf_transformation,[],[f116]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SWC369+1 : TPTP v8.2.0. Released v2.4.0.
% 0.07/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.14/0.36  % Computer : n014.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit   : 300
% 0.14/0.37  % WCLimit    : 300
% 0.14/0.37  % DateTime   : Sun May 19 03:45:08 EDT 2024
% 0.14/0.37  % CPUTime    : 
% 0.14/0.37  This is a FOF_THM_RFO_SEQ problem
% 0.14/0.37  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.73/0.88  % (20697)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2994ds/34Mi)
% 0.73/0.88  % (20699)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2994ds/78Mi)
% 0.73/0.88  % (20698)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2994ds/51Mi)
% 0.73/0.88  % (20700)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2994ds/33Mi)
% 0.73/0.88  % (20701)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2994ds/34Mi)
% 0.73/0.88  % (20702)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2994ds/45Mi)
% 0.73/0.88  % (20703)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2994ds/83Mi)
% 0.73/0.88  % (20704)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2994ds/56Mi)
% 0.73/0.88  % (20700)First to succeed.
% 0.73/0.88  % (20702)Also succeeded, but the first one will report.
% 0.73/0.88  % (20699)Also succeeded, but the first one will report.
% 0.73/0.88  % (20700)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-20696"
% 0.73/0.88  % (20700)Refutation found. Thanks to Tanya!
% 0.73/0.88  % SZS status Theorem for theBenchmark
% 0.73/0.88  % SZS output start Proof for theBenchmark
% See solution above
% 0.73/0.88  % (20700)------------------------------
% 0.73/0.88  % (20700)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.73/0.88  % (20700)Termination reason: Refutation
% 0.73/0.88  
% 0.73/0.88  % (20700)Memory used [KB]: 1170
% 0.73/0.88  % (20700)Time elapsed: 0.005 s
% 0.73/0.88  % (20700)Instructions burned: 6 (million)
% 0.73/0.88  % (20696)Success in time 0.504 s
% 0.73/0.88  % Vampire---4.8 exiting
%------------------------------------------------------------------------------