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

View Problem - Process Solution

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

% Computer : n028.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 : Sun May  5 12:08:41 EDT 2024

% Result   : Theorem 0.13s 0.36s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   31 (   7 unt;   0 def)
%            Number of atoms       :   79 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   71 (  23   ~;  15   |;  20   &)
%                                         (   0 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   36 (  22   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f33,plain,
    $false,
    inference(resolution,[],[f32,f29]) ).

fof(f29,plain,
    big_s(sK1),
    inference(resolution,[],[f28,f25]) ).

fof(f25,plain,
    ( ~ big_q(sK2)
    | big_s(sK1) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f19,plain,
    ( ( big_s(sK1)
      & big_q(sK1) )
    | ~ big_q(sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f16,f18,f17]) ).

fof(f17,plain,
    ( ? [X0] :
        ( big_s(X0)
        & big_q(X0) )
   => ( big_s(sK1)
      & big_q(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f18,plain,
    ( ? [X1] : ~ big_q(X1)
   => ~ big_q(sK2) ),
    introduced(choice_axiom,[]) ).

fof(f16,plain,
    ( ? [X0] :
        ( big_s(X0)
        & big_q(X0) )
    | ? [X1] : ~ big_q(X1) ),
    inference(rectify,[],[f11]) ).

fof(f11,plain,
    ( ? [X1] :
        ( big_s(X1)
        & big_q(X1) )
    | ? [X0] : ~ big_q(X0) ),
    inference(ennf_transformation,[],[f8]) ).

fof(f8,plain,
    ( ! [X0] : big_q(X0)
   => ? [X1] :
        ( big_s(X1)
        & big_q(X1) ) ),
    inference(pure_predicate_removal,[],[f6]) ).

fof(f6,plain,
    ( ! [X0] :
        ( big_r(X0)
        | big_q(X0) )
   => ? [X1] :
        ( big_s(X1)
        & big_q(X1) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,axiom,
    ( ! [X0] :
        ( big_r(X0)
        | big_q(X0) )
   => ? [X2] :
        ( big_s(X2)
        & big_q(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_2) ).

fof(f28,plain,
    ! [X0] : big_q(X0),
    inference(resolution,[],[f27,f21]) ).

fof(f21,plain,
    big_p(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f15,plain,
    ( ~ big_g(sK0)
    & big_f(sK0)
    & big_p(sK0) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f10,f14]) ).

fof(f14,plain,
    ( ? [X0] :
        ( ~ big_g(X0)
        & big_f(X0)
        & big_p(X0) )
   => ( ~ big_g(sK0)
      & big_f(sK0)
      & big_p(sK0) ) ),
    introduced(choice_axiom,[]) ).

fof(f10,plain,
    ? [X0] :
      ( ~ big_g(X0)
      & big_f(X0)
      & big_p(X0) ),
    inference(flattening,[],[f9]) ).

fof(f9,plain,
    ? [X0] :
      ( ~ big_g(X0)
      & big_f(X0)
      & big_p(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f5,negated_conjecture,
    ~ ! [X0] :
        ( ( big_f(X0)
          & big_p(X0) )
       => big_g(X0) ),
    inference(negated_conjecture,[],[f4]) ).

fof(f4,conjecture,
    ! [X0] :
      ( ( big_f(X0)
        & big_p(X0) )
     => big_g(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ big_p(X0)
      | big_q(X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,plain,
    ! [X0] :
      ( ! [X1] : big_q(X1)
      | ~ big_p(X0) ),
    inference(ennf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0] :
      ( big_p(X0)
     => ! [X1] : big_q(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_1) ).

fof(f32,plain,
    ! [X0] : ~ big_s(X0),
    inference(subsumption_resolution,[],[f31,f23]) ).

fof(f23,plain,
    ~ big_g(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f31,plain,
    ! [X0] :
      ( big_g(sK0)
      | ~ big_s(X0) ),
    inference(resolution,[],[f26,f22]) ).

fof(f22,plain,
    big_f(sK0),
    inference(cnf_transformation,[],[f15]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ big_f(X0)
      | big_g(X0)
      | ~ big_s(X1) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f20,plain,
    ( ! [X0] :
        ( big_g(X0)
        | ~ big_f(X0) )
    | ! [X1] : ~ big_s(X1) ),
    inference(rectify,[],[f12]) ).

fof(f12,plain,
    ( ! [X1] :
        ( big_g(X1)
        | ~ big_f(X1) )
    | ! [X0] : ~ big_s(X0) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f7,plain,
    ( ? [X0] : big_s(X0)
   => ! [X1] :
        ( big_f(X1)
       => big_g(X1) ) ),
    inference(rectify,[],[f3]) ).

fof(f3,axiom,
    ( ? [X0] : big_s(X0)
   => ! [X2] :
        ( big_f(X2)
       => big_g(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel28_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SYN058+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.13  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Fri May  3 17:44:08 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.35  % (1149)Running in auto input_syntax mode. Trying TPTP
% 0.13/0.36  % (1150)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.13/0.36  % (1151)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.13/0.36  % (1153)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.13/0.36  % (1155)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.13/0.36  % (1152)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.13/0.36  % (1154)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.13/0.36  % (1156)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.13/0.36  Detected minimum model sizes of [1]
% 0.13/0.36  Detected minimum model sizes of [1,1,1]
% 0.13/0.36  Detected minimum model sizes of [1,1,1]
% 0.13/0.36  Detected maximum model sizes of [1,1,1]
% 0.13/0.36  Detected maximum model sizes of [1,1,1]
% 0.13/0.36  Detected maximum model sizes of [3]
% 0.13/0.36  TRYING [1,1,1]
% 0.13/0.36  TRYING [1,1,1]
% 0.13/0.36  TRYING [1]
% 0.13/0.36  Cannot enumerate next child to try in an incomplete setup
% 0.13/0.36  Cannot enumerate next child to try in an incomplete setup
% 0.13/0.36  Detected minimum model sizes of [1]
% 0.13/0.36  Detected maximum model sizes of [3]
% 0.13/0.36  % (1151)Refutation not found, incomplete strategy% (1151)------------------------------
% 0.13/0.36  % (1151)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.36  TRYING [2]
% 0.13/0.36  % (1151)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36  
% 0.13/0.36  % (1151)Memory used [KB]: 727
% 0.13/0.36  % (1151)Time elapsed: 0.003 s
% 0.13/0.36  % (1154)First to succeed.
% 0.13/0.36  % (1151)Instructions burned: 2 (million)
% 0.13/0.36  TRYING [1]
% 0.13/0.36  % (1150)Also succeeded, but the first one will report.
% 0.13/0.36  % (1153)Refutation not found, incomplete strategy% (1153)------------------------------
% 0.13/0.36  % (1153)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.36  % (1153)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.36  
% 0.13/0.36  TRYING [2]
% 0.13/0.36  % (1153)Memory used [KB]: 727
% 0.13/0.36  % (1153)Time elapsed: 0.003 s
% 0.13/0.36  % (1153)Instructions burned: 2 (million)
% 0.13/0.36  % (1156)Also succeeded, but the first one will report.
% 0.13/0.36  % (1155)Also succeeded, but the first one will report.
% 0.13/0.36  % (1151)------------------------------
% 0.13/0.36  % (1151)------------------------------
% 0.13/0.36  % (1152)Also succeeded, but the first one will report.
% 0.13/0.36  % (1153)------------------------------
% 0.13/0.36  % (1153)------------------------------
% 0.13/0.36  % (1154)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1149"
% 0.13/0.36  % (1154)Refutation found. Thanks to Tanya!
% 0.13/0.36  % SZS status Theorem for theBenchmark
% 0.13/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.36  % (1154)------------------------------
% 0.13/0.36  % (1154)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.13/0.36  % (1154)Termination reason: Refutation
% 0.13/0.36  
% 0.13/0.36  % (1154)Memory used [KB]: 733
% 0.13/0.36  % (1154)Time elapsed: 0.003 s
% 0.13/0.36  % (1154)Instructions burned: 2 (million)
% 0.13/0.36  % (1149)Success in time 0.006 s
%------------------------------------------------------------------------------