TSTP Solution File: SWC262+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SWC262+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 Apr 30 16:15:23 EDT 2024

% Result   : Theorem 0.22s 0.40s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :  109 (  27 equ)
%            Maximal formula atoms :   16 (   4 avg)
%            Number of connectives :  107 (  21   ~;   6   |;  65   &)
%                                         (   3 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   32 (   8   !;  24   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f652,plain,
    $false,
    inference(avatar_sat_refutation,[],[f640,f645,f650,f651]) ).

fof(f651,plain,
    ~ spl69_3,
    inference(avatar_split_clause,[],[f599,f647]) ).

fof(f647,plain,
    ( spl69_3
  <=> totalorderedP(sK20) ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_3])]) ).

fof(f599,plain,
    ~ totalorderedP(sK20),
    inference(definition_unfolding,[],[f381,f379]) ).

fof(f379,plain,
    sK18 = sK20,
    inference(cnf_transformation,[],[f254]) ).

fof(f254,plain,
    ( ~ totalorderedP(sK18)
    & totalorderedP(sK20)
    & sK18 = sK20
    & sK19 = sK21
    & ssList(sK21)
    & ssList(sK20)
    & ssList(sK19)
    & ssList(sK18) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK18,sK19,sK20,sK21])],[f99,f253,f252,f251,f250]) ).

fof(f250,plain,
    ( ? [X0] :
        ( ? [X1] :
            ( ? [X2] :
                ( ? [X3] :
                    ( ~ totalorderedP(X0)
                    & totalorderedP(X2)
                    & X0 = X2
                    & X1 = X3
                    & ssList(X3) )
                & ssList(X2) )
            & ssList(X1) )
        & ssList(X0) )
   => ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ totalorderedP(sK18)
                  & totalorderedP(X2)
                  & sK18 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(sK18) ) ),
    introduced(choice_axiom,[]) ).

fof(f251,plain,
    ( ? [X1] :
        ( ? [X2] :
            ( ? [X3] :
                ( ~ totalorderedP(sK18)
                & totalorderedP(X2)
                & sK18 = X2
                & X1 = X3
                & ssList(X3) )
            & ssList(X2) )
        & ssList(X1) )
   => ( ? [X2] :
          ( ? [X3] :
              ( ~ totalorderedP(sK18)
              & totalorderedP(X2)
              & sK18 = X2
              & sK19 = X3
              & ssList(X3) )
          & ssList(X2) )
      & ssList(sK19) ) ),
    introduced(choice_axiom,[]) ).

fof(f252,plain,
    ( ? [X2] :
        ( ? [X3] :
            ( ~ totalorderedP(sK18)
            & totalorderedP(X2)
            & sK18 = X2
            & sK19 = X3
            & ssList(X3) )
        & ssList(X2) )
   => ( ? [X3] :
          ( ~ totalorderedP(sK18)
          & totalorderedP(sK20)
          & sK18 = sK20
          & sK19 = X3
          & ssList(X3) )
      & ssList(sK20) ) ),
    introduced(choice_axiom,[]) ).

fof(f253,plain,
    ( ? [X3] :
        ( ~ totalorderedP(sK18)
        & totalorderedP(sK20)
        & sK18 = sK20
        & sK19 = X3
        & ssList(X3) )
   => ( ~ totalorderedP(sK18)
      & totalorderedP(sK20)
      & sK18 = sK20
      & sK19 = sK21
      & ssList(sK21) ) ),
    introduced(choice_axiom,[]) ).

fof(f99,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ totalorderedP(X0)
                  & totalorderedP(X2)
                  & X0 = X2
                  & X1 = X3
                  & ssList(X3) )
              & ssList(X2) )
          & ssList(X1) )
      & ssList(X0) ),
    inference(flattening,[],[f98]) ).

fof(f98,plain,
    ? [X0] :
      ( ? [X1] :
          ( ? [X2] :
              ( ? [X3] :
                  ( ~ totalorderedP(X0)
                  & totalorderedP(X2)
                  & 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)
                   => ( totalorderedP(X0)
                      | ~ totalorderedP(X2)
                      | X0 != X2
                      | X1 != X3 ) ) ) ) ),
    inference(negated_conjecture,[],[f96]) ).

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

fof(f381,plain,
    ~ totalorderedP(sK18),
    inference(cnf_transformation,[],[f254]) ).

fof(f650,plain,
    spl69_3,
    inference(avatar_split_clause,[],[f380,f647]) ).

fof(f380,plain,
    totalorderedP(sK20),
    inference(cnf_transformation,[],[f254]) ).

fof(f645,plain,
    spl69_2,
    inference(avatar_split_clause,[],[f377,f642]) ).

fof(f642,plain,
    ( spl69_2
  <=> ssList(sK21) ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_2])]) ).

fof(f377,plain,
    ssList(sK21),
    inference(cnf_transformation,[],[f254]) ).

fof(f640,plain,
    spl69_1,
    inference(avatar_split_clause,[],[f376,f637]) ).

fof(f637,plain,
    ( spl69_1
  <=> ssList(sK20) ),
    introduced(avatar_definition,[new_symbols(naming,[spl69_1])]) ).

fof(f376,plain,
    ssList(sK20),
    inference(cnf_transformation,[],[f254]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SWC262+1 : TPTP v8.1.2. Released v2.4.0.
% 0.15/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n014.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.22/0.36  % CPULimit   : 300
% 0.22/0.36  % WCLimit    : 300
% 0.22/0.36  % DateTime   : Tue Apr 30 03:58:49 EDT 2024
% 0.22/0.36  % CPUTime    : 
% 0.22/0.37  % (27683)Running in auto input_syntax mode. Trying TPTP
% 0.22/0.38  % (27687)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.22/0.39  % (27686)WARNING: value z3 for option sas not known
% 0.22/0.39  % (27684)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.22/0.39  % (27685)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.22/0.39  % (27688)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.22/0.39  % (27689)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.39  % (27686)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.22/0.39  % (27690)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.22/0.39  % (27688)First to succeed.
% 0.22/0.40  TRYING [1]
% 0.22/0.40  % (27690)Also succeeded, but the first one will report.
% 0.22/0.40  TRYING [2]
% 0.22/0.40  % (27689)Also succeeded, but the first one will report.
% 0.22/0.40  % (27688)Refutation found. Thanks to Tanya!
% 0.22/0.40  % SZS status Theorem for theBenchmark
% 0.22/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.40  % (27688)------------------------------
% 0.22/0.40  % (27688)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.22/0.40  % (27688)Termination reason: Refutation
% 0.22/0.40  
% 0.22/0.40  % (27688)Memory used [KB]: 1232
% 0.22/0.40  % (27688)Time elapsed: 0.010 s
% 0.22/0.40  % (27688)Instructions burned: 16 (million)
% 0.22/0.40  % (27688)------------------------------
% 0.22/0.40  % (27688)------------------------------
% 0.22/0.40  % (27683)Success in time 0.03 s
%------------------------------------------------------------------------------