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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n007.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 18:11:11 EDT 2024

% Result   : Theorem 0.15s 0.39s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   25 (   6 unt;   0 def)
%            Number of atoms       :   88 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  101 (  38   ~;  34   |;  22   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :   65 (  53   !;  12   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,plain,
    $false,
    inference(subsumption_resolution,[],[f24,f23]) ).

fof(f23,plain,
    ! [X0] : p(f(X0)),
    inference(resolution,[],[f22,f11]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | p(f(X1)) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( ( ~ p(X0)
        & p(f(X1)) )
      | ~ sP0(X0,X1) ),
    inference(rectify,[],[f6]) ).

fof(f6,plain,
    ! [X3,X4] :
      ( ( ~ p(X3)
        & p(f(X4)) )
      | ~ sP0(X3,X4) ),
    inference(nnf_transformation,[],[f4]) ).

fof(f4,plain,
    ! [X3,X4] :
      ( ( ~ p(X3)
        & p(f(X4)) )
      | ~ sP0(X3,X4) ),
    introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).

fof(f22,plain,
    ! [X0,X1] : sP0(f(X0),X1),
    inference(resolution,[],[f21,f13]) ).

fof(f13,plain,
    ! [X4] : q(f(X4)),
    inference(cnf_transformation,[],[f10]) ).

fof(f10,plain,
    ( ! [X2,X3] :
        ( ~ q(X2)
        | ( ( ~ r(sK1)
            | ~ r(sK2) )
          & r(X3) )
        | sP0(X2,X3) )
    & ! [X4] : q(f(X4)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f8,f9]) ).

fof(f9,plain,
    ( ? [X0,X1] :
        ( ! [X2,X3] :
            ( ~ q(X2)
            | ( ( ~ r(X0)
                | ~ r(X1) )
              & r(X3) )
            | sP0(X2,X3) )
        & ! [X4] : q(f(X4)) )
   => ( ! [X3,X2] :
          ( ~ q(X2)
          | ( ( ~ r(sK1)
              | ~ r(sK2) )
            & r(X3) )
          | sP0(X2,X3) )
      & ! [X4] : q(f(X4)) ) ),
    introduced(choice_axiom,[]) ).

fof(f8,plain,
    ? [X0,X1] :
      ( ! [X2,X3] :
          ( ~ q(X2)
          | ( ( ~ r(X0)
              | ~ r(X1) )
            & r(X3) )
          | sP0(X2,X3) )
      & ! [X4] : q(f(X4)) ),
    inference(rectify,[],[f5]) ).

fof(f5,plain,
    ? [X0,X1] :
      ( ! [X3,X4] :
          ( ~ q(X3)
          | ( ( ~ r(X0)
              | ~ r(X1) )
            & r(X4) )
          | sP0(X3,X4) )
      & ! [X2] : q(f(X2)) ),
    inference(definition_folding,[],[f3,f4]) ).

fof(f3,plain,
    ? [X0,X1] :
      ( ! [X3,X4] :
          ( ~ q(X3)
          | ( ( ~ r(X0)
              | ~ r(X1) )
            & r(X4) )
          | ( ~ p(X3)
            & p(f(X4)) ) )
      & ! [X2] : q(f(X2)) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ! [X0,X1] :
        ( ! [X2] : q(f(X2))
       => ? [X3,X4] :
            ( q(X3)
            & ( r(X4)
             => ( r(X0)
                & r(X1) ) )
            & ( p(f(X4))
             => p(X3) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ! [X0,X1] :
      ( ! [X2] : q(f(X2))
     => ? [X3,X4] :
          ( q(X3)
          & ( r(X4)
           => ( r(X0)
              & r(X1) ) )
          & ( p(f(X4))
           => p(X3) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ q(X0)
      | sP0(X0,X1) ),
    inference(subsumption_resolution,[],[f20,f19]) ).

fof(f19,plain,
    ! [X0] : r(X0),
    inference(subsumption_resolution,[],[f18,f17]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ p(f(X0))
      | r(X1) ),
    inference(resolution,[],[f12,f16]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( sP0(f(X1),X0)
      | r(X0) ),
    inference(resolution,[],[f14,f13]) ).

fof(f14,plain,
    ! [X2,X3] :
      ( ~ q(X2)
      | r(X3)
      | sP0(X2,X3) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ sP0(X0,X1)
      | ~ p(X0) ),
    inference(cnf_transformation,[],[f7]) ).

fof(f18,plain,
    ! [X0] :
      ( p(f(X0))
      | r(X0) ),
    inference(resolution,[],[f11,f16]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ r(sK1)
      | ~ q(X0)
      | sP0(X0,X1) ),
    inference(resolution,[],[f19,f15]) ).

fof(f15,plain,
    ! [X2,X3] :
      ( ~ r(sK2)
      | ~ r(sK1)
      | ~ q(X2)
      | sP0(X2,X3) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f24,plain,
    ! [X0] : ~ p(f(X0)),
    inference(resolution,[],[f22,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SYN939+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n007.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.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Tue Apr 30 01:47:02 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (3541)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (3542)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38  % (3544)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.38  % (3543)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38  % (3545)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.38  % (3546)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.38  % (3547)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.38  % (3548)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  Detected minimum model sizes of [1,1]
% 0.15/0.38  Detected maximum model sizes of [max,2]
% 0.15/0.38  Detected minimum model sizes of [1,1]
% 0.15/0.38  Detected maximum model sizes of [max,2]
% 0.15/0.38  TRYING [1,1]
% 0.15/0.38  TRYING [1,1]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  % (3546)First to succeed.
% 0.15/0.38  TRYING [2,1]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [2,1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2,2]
% 0.15/0.38  TRYING [2,2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [3,2]
% 0.15/0.38  TRYING [3,2]
% 0.15/0.38  % (3542)Also succeeded, but the first one will report.
% 0.15/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.15/0.38  % (3543)Refutation not found, incomplete strategy% (3543)------------------------------
% 0.15/0.38  % (3543)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.38  % (3543)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38  
% 0.15/0.38  % (3543)Memory used [KB]: 726
% 0.15/0.38  % (3543)Time elapsed: 0.004 s
% 0.15/0.38  % (3543)Instructions burned: 4 (million)
% 0.15/0.38  % (3543)------------------------------
% 0.15/0.38  % (3543)------------------------------
% 0.15/0.38  Cannot enumerate next child to try in an incomplete setup
% 0.15/0.38  % (3545)Refutation not found, incomplete strategy% (3545)------------------------------
% 0.15/0.38  % (3545)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.38  % (3545)Termination reason: Refutation not found, incomplete strategy
% 0.15/0.38  
% 0.15/0.38  % (3545)Memory used [KB]: 727
% 0.15/0.38  % (3545)Time elapsed: 0.004 s
% 0.15/0.38  % (3545)Instructions burned: 4 (million)
% 0.15/0.38  % (3545)------------------------------
% 0.15/0.38  % (3545)------------------------------
% 0.15/0.39  % (3544)Also succeeded, but the first one will report.
% 0.15/0.39  % (3546)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Theorem for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39  % (3546)------------------------------
% 0.15/0.39  % (3546)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.15/0.39  % (3546)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (3546)Memory used [KB]: 745
% 0.15/0.39  % (3546)Time elapsed: 0.003 s
% 0.15/0.39  % (3546)Instructions burned: 3 (million)
% 0.15/0.39  % (3546)------------------------------
% 0.15/0.39  % (3546)------------------------------
% 0.15/0.39  % (3541)Success in time 0.018 s
%------------------------------------------------------------------------------