TSTP Solution File: SYN334-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SYN334-1 : TPTP v8.1.0. Released v1.2.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 : n003.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:33 EDT 2022

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   48 (  25   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 2-2 aty)
%            Number of variables   :   37 (  37   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f36,plain,
    $false,
    inference(subsumption_resolution,[],[f34,f33]) ).

fof(f33,plain,
    ! [X2,X3] : f(X2,X3),
    inference(resolution,[],[f31,f4]) ).

fof(f4,axiom,
    ! [X0,X1] :
      ( f(z(X0,X1),z(X0,X1))
      | f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause4) ).

fof(f31,plain,
    ! [X6] : ~ f(X6,X6),
    inference(subsumption_resolution,[],[f30,f12]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( f(X1,z(X0,X1))
      | f(X0,z(X0,X1))
      | ~ f(X0,X1) ),
    inference(resolution,[],[f1,f8]) ).

fof(f8,plain,
    ! [X0,X1] :
      ( g(X0,X1)
      | f(X0,X1) ),
    inference(resolution,[],[f6,f5]) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( ~ g(z(X0,X1),z(X0,X1))
      | f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause5) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( g(z(X0,X1),z(X0,X1))
      | g(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause6) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ g(X1,z(X0,X1))
      | ~ f(X0,X1)
      | f(X0,z(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause1) ).

fof(f30,plain,
    ! [X6] :
      ( ~ f(X6,z(X6,X6))
      | ~ f(X6,X6) ),
    inference(resolution,[],[f25,f19]) ).

fof(f19,plain,
    ! [X0] :
      ( g(X0,z(X0,X0))
      | ~ f(X0,X0) ),
    inference(duplicate_literal_removal,[],[f18]) ).

fof(f18,plain,
    ! [X0] :
      ( g(X0,z(X0,X0))
      | ~ f(X0,X0)
      | ~ f(X0,X0) ),
    inference(resolution,[],[f15,f2]) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( ~ f(X0,z(X0,X1))
      | g(X1,z(X0,X1))
      | ~ f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause2) ).

fof(f15,plain,
    ! [X0] :
      ( f(X0,z(X0,X0))
      | ~ f(X0,X0) ),
    inference(factoring,[],[f12]) ).

fof(f25,plain,
    ! [X0,X1] :
      ( ~ g(X0,X1)
      | ~ f(X0,X1) ),
    inference(resolution,[],[f24,f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ g(z(X0,X1),z(X0,X1))
      | ~ g(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause7) ).

fof(f24,plain,
    ! [X0,X1] :
      ( g(z(X0,X1),z(X0,X1))
      | ~ f(X0,X1) ),
    inference(subsumption_resolution,[],[f22,f6]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ~ g(X0,X1)
      | ~ f(X0,X1)
      | g(z(X0,X1),z(X0,X1)) ),
    inference(resolution,[],[f3,f11]) ).

fof(f11,plain,
    ! [X2,X3] :
      ( f(z(X2,X3),z(X2,X3))
      | ~ g(X2,X3) ),
    inference(resolution,[],[f7,f8]) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( ~ f(z(X0,X1),z(X0,X1))
      | g(z(X0,X1),z(X0,X1))
      | ~ f(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f34,plain,
    ! [X0,X1] : ~ f(X0,X1),
    inference(resolution,[],[f32,f24]) ).

fof(f32,plain,
    ! [X0,X1] : ~ g(X0,X1),
    inference(resolution,[],[f31,f11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN334-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/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.33  % Computer : n003.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % 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:45:08 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.48  % (19524)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.19/0.48  % (19524)First to succeed.
% 0.19/0.48  % (19524)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (19524)------------------------------
% 0.19/0.48  % (19524)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.48  % (19524)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.48  % (19524)Termination reason: Refutation
% 0.19/0.48  
% 0.19/0.48  % (19524)Memory used [KB]: 5373
% 0.19/0.48  % (19524)Time elapsed: 0.083 s
% 0.19/0.48  % (19524)Instructions burned: 2 (million)
% 0.19/0.48  % (19524)------------------------------
% 0.19/0.48  % (19524)------------------------------
% 0.19/0.48  % (19511)Success in time 0.137 s
%------------------------------------------------------------------------------