TSTP Solution File: SYN328+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s

% Computer : n002.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 : Wed Aug 31 19:37:32 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :  116 (   0 equ)
%            Maximal formula atoms :   13 (   4 avg)
%            Number of connectives :  116 (  29   ~;  37   |;  14   &)
%                                         (  15 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   0 con; 1-1 aty)
%            Number of variables   :   38 (  31   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f63,plain,
    $false,
    inference(resolution,[],[f62,f49]) ).

fof(f49,plain,
    ! [X1] : big_f(X1),
    inference(resolution,[],[f47,f13]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ big_g(sK0(X0))
      | big_f(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f5,plain,
    ! [X0] :
    ? [X2,X1] :
      ( ( ( big_h(X2)
          | ~ big_f(X2) )
      <=> big_g(X0) )
      & ( big_f(X0)
      <=> ( ~ big_f(X2)
          | big_g(X2) ) )
      & ( ~ big_g(X1)
        | ~ big_h(X1)
        | ~ big_f(X1) )
      & ( big_h(X0)
      <=> ( big_h(X2)
          | ( ~ big_g(X2)
            & big_f(X2) ) ) ) ),
    inference(flattening,[],[f4]) ).

fof(f4,plain,
    ! [X0] :
    ? [X2,X1] :
      ( ( ~ big_g(X1)
        | ~ big_h(X1)
        | ~ big_f(X1) )
      & ( big_h(X0)
      <=> ( big_h(X2)
          | ( ~ big_g(X2)
            & big_f(X2) ) ) )
      & ( ( big_h(X2)
          | ~ big_f(X2) )
      <=> big_g(X0) )
      & ( big_f(X0)
      <=> ( ~ big_f(X2)
          | big_g(X2) ) ) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f3,plain,
    ~ ? [X0] :
      ! [X2,X1] :
        ( ( ( big_f(X2)
           => big_g(X2) )
        <=> big_f(X0) )
       => ( ( big_g(X0)
          <=> ( big_f(X2)
             => big_h(X2) ) )
         => ( ( big_h(X0)
            <=> ( ( big_f(X2)
                 => big_g(X2) )
               => big_h(X2) ) )
           => ( big_h(X1)
              & big_f(X1)
              & big_g(X1) ) ) ) ),
    inference(rectify,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
      ! [X2,X1] :
        ( ( big_f(X0)
        <=> ( big_f(X1)
           => big_g(X1) ) )
       => ( ( big_g(X0)
          <=> ( big_f(X1)
             => big_h(X1) ) )
         => ( ( ( ( big_f(X1)
                 => big_g(X1) )
               => big_h(X1) )
            <=> big_h(X0) )
           => ( big_g(X2)
              & big_h(X2)
              & big_f(X2) ) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    ? [X0] :
    ! [X2,X1] :
      ( ( big_f(X0)
      <=> ( big_f(X1)
         => big_g(X1) ) )
     => ( ( big_g(X0)
        <=> ( big_f(X1)
           => big_h(X1) ) )
       => ( ( ( ( big_f(X1)
               => big_g(X1) )
             => big_h(X1) )
          <=> big_h(X0) )
         => ( big_g(X2)
            & big_h(X2)
            & big_f(X2) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_3) ).

fof(f47,plain,
    ! [X1] : big_g(X1),
    inference(resolution,[],[f45,f10]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ big_h(sK0(X0))
      | big_g(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f45,plain,
    ! [X0] : big_h(X0),
    inference(duplicate_literal_removal,[],[f43]) ).

fof(f43,plain,
    ! [X0] :
      ( big_h(X0)
      | big_h(X0) ),
    inference(resolution,[],[f41,f15]) ).

fof(f15,plain,
    ! [X0] :
      ( ~ big_h(sK0(X0))
      | big_h(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f41,plain,
    ! [X1] :
      ( big_h(sK0(X1))
      | big_h(X1) ),
    inference(resolution,[],[f39,f24]) ).

fof(f24,plain,
    ! [X0] :
      ( big_g(sK0(X0))
      | big_h(X0) ),
    inference(duplicate_literal_removal,[],[f23]) ).

fof(f23,plain,
    ! [X0] :
      ( big_g(sK0(X0))
      | big_h(X0)
      | big_h(X0) ),
    inference(resolution,[],[f21,f6]) ).

fof(f6,plain,
    ! [X0] :
      ( ~ big_f(sK0(X0))
      | big_g(sK0(X0))
      | big_h(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f21,plain,
    ! [X0] :
      ( big_f(sK0(X0))
      | big_h(X0) ),
    inference(resolution,[],[f20,f15]) ).

fof(f20,plain,
    ! [X0] :
      ( big_h(X0)
      | big_f(X0) ),
    inference(duplicate_literal_removal,[],[f19]) ).

fof(f19,plain,
    ! [X0] :
      ( big_f(X0)
      | big_h(X0)
      | big_f(X0) ),
    inference(resolution,[],[f17,f13]) ).

fof(f17,plain,
    ! [X0] :
      ( big_g(sK0(X0))
      | big_h(X0)
      | big_f(X0) ),
    inference(resolution,[],[f6,f14]) ).

fof(f14,plain,
    ! [X0] :
      ( big_f(sK0(X0))
      | big_f(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f39,plain,
    ! [X0] :
      ( ~ big_g(X0)
      | big_h(X0) ),
    inference(duplicate_literal_removal,[],[f37]) ).

fof(f37,plain,
    ! [X0] :
      ( big_h(X0)
      | big_h(X0)
      | ~ big_g(X0) ),
    inference(resolution,[],[f32,f15]) ).

fof(f32,plain,
    ! [X0] :
      ( big_h(sK0(X0))
      | big_h(X0)
      | ~ big_g(X0) ),
    inference(resolution,[],[f11,f21]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ big_f(sK0(X0))
      | big_h(sK0(X0))
      | ~ big_g(X0) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f62,plain,
    ! [X0] : ~ big_f(sK1(X0)),
    inference(resolution,[],[f60,f47]) ).

fof(f60,plain,
    ! [X1] :
      ( ~ big_g(sK1(X1))
      | ~ big_f(sK1(X1)) ),
    inference(resolution,[],[f16,f45]) ).

fof(f16,plain,
    ! [X0] :
      ( ~ big_h(sK1(X0))
      | ~ big_f(sK1(X0))
      | ~ big_g(sK1(X0)) ),
    inference(cnf_transformation,[],[f5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SYN328+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34  % Computer : n002.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   : Tue Aug 30 21:55:29 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.46  % (28234)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.47  % (28242)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.19/0.47  % (28234)First to succeed.
% 0.19/0.47  % (28234)Refutation found. Thanks to Tanya!
% 0.19/0.47  % SZS status Theorem for theBenchmark
% 0.19/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.47  % (28234)------------------------------
% 0.19/0.47  % (28234)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.47  % (28234)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.47  % (28234)Termination reason: Refutation
% 0.19/0.47  
% 0.19/0.47  % (28234)Memory used [KB]: 5373
% 0.19/0.47  % (28234)Time elapsed: 0.067 s
% 0.19/0.47  % (28234)Instructions burned: 2 (million)
% 0.19/0.47  % (28234)------------------------------
% 0.19/0.47  % (28234)------------------------------
% 0.19/0.47  % (28222)Success in time 0.123 s
%------------------------------------------------------------------------------