TSTP Solution File: SET838-2 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : SET838-2 : TPTP v8.1.0. Released v3.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 : 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 18:25:50 EDT 2022

% Result   : Unsatisfiable 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   39 (  17 unt;   0 def)
%            Number of atoms       :   61 (  43 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   47 (  25   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   3 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-1 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f86,plain,
    $false,
    inference(avatar_sat_refutation,[],[f67,f70,f83]) ).

fof(f83,plain,
    ~ spl6_2,
    inference(avatar_contradiction_clause,[],[f82]) ).

fof(f82,plain,
    ( $false
    | ~ spl6_2 ),
    inference(trivial_inequality_removal,[],[f79]) ).

fof(f79,plain,
    ( sF0 != sF0
    | ~ spl6_2 ),
    inference(superposition,[],[f45,f76]) ).

fof(f76,plain,
    ( v_xa(sF0) = sF0
    | ~ spl6_2 ),
    inference(superposition,[],[f75,f49]) ).

fof(f49,plain,
    v_xa(sF0) = sF5(sF0),
    inference(trivial_inequality_removal,[],[f46]) ).

fof(f46,plain,
    ( v_xa(sF0) = sF5(sF0)
    | sF0 != sF0 ),
    inference(superposition,[],[f14,f17]) ).

fof(f17,plain,
    sF2(sF0) = sF0,
    inference(forward_demodulation,[],[f16,f5]) ).

fof(f5,plain,
    v_g(v_x) = sF0,
    introduced(function_definition,[]) ).

fof(f16,plain,
    v_g(v_x) = sF2(sF0),
    inference(superposition,[],[f8,f15]) ).

fof(f15,plain,
    v_x = v_f(sF0),
    inference(forward_demodulation,[],[f6,f7]) ).

fof(f7,plain,
    v_x = sF1,
    inference(definition_folding,[],[f1,f6,f5]) ).

fof(f1,axiom,
    v_x = v_f(v_g(v_x)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

fof(f6,plain,
    sF1 = v_f(sF0),
    introduced(function_definition,[]) ).

fof(f8,plain,
    ! [X0] : v_g(v_f(X0)) = sF2(X0),
    introduced(function_definition,[]) ).

fof(f14,plain,
    ! [X0] :
      ( sF2(X0) != X0
      | v_xa(X0) = sF5(X0) ),
    inference(definition_folding,[],[f3,f13,f12,f8]) ).

fof(f12,plain,
    ! [X0] : v_f(v_xa(X0)) = sF4(X0),
    introduced(function_definition,[]) ).

fof(f13,plain,
    ! [X0] : v_g(sF4(X0)) = sF5(X0),
    introduced(function_definition,[]) ).

fof(f3,axiom,
    ! [X0] :
      ( v_g(v_f(X0)) != X0
      | v_xa(X0) = v_g(v_f(v_xa(X0))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f75,plain,
    ( sF5(sF0) = sF0
    | ~ spl6_2 ),
    inference(forward_demodulation,[],[f72,f5]) ).

fof(f72,plain,
    ( v_g(v_x) = sF5(sF0)
    | ~ spl6_2 ),
    inference(superposition,[],[f13,f66]) ).

fof(f66,plain,
    ( v_x = sF4(sF0)
    | ~ spl6_2 ),
    inference(avatar_component_clause,[],[f64]) ).

fof(f64,plain,
    ( spl6_2
  <=> v_x = sF4(sF0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_2])]) ).

fof(f45,plain,
    v_xa(sF0) != sF0,
    inference(trivial_inequality_removal,[],[f42]) ).

fof(f42,plain,
    ( sF0 != sF0
    | v_xa(sF0) != sF0 ),
    inference(superposition,[],[f9,f17]) ).

fof(f9,plain,
    ! [X0] :
      ( sF2(X0) != X0
      | v_xa(X0) != X0 ),
    inference(definition_folding,[],[f4,f8]) ).

fof(f4,axiom,
    ! [X0] :
      ( v_g(v_f(X0)) != X0
      | v_xa(X0) != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f70,plain,
    spl6_1,
    inference(avatar_contradiction_clause,[],[f69]) ).

fof(f69,plain,
    ( $false
    | spl6_1 ),
    inference(trivial_inequality_removal,[],[f68]) ).

fof(f68,plain,
    ( sF4(sF0) != sF4(sF0)
    | spl6_1 ),
    inference(superposition,[],[f62,f12]) ).

fof(f62,plain,
    ( v_f(v_xa(sF0)) != sF4(sF0)
    | spl6_1 ),
    inference(avatar_component_clause,[],[f60]) ).

fof(f60,plain,
    ( spl6_1
  <=> v_f(v_xa(sF0)) = sF4(sF0) ),
    introduced(avatar_definition,[new_symbols(naming,[spl6_1])]) ).

fof(f67,plain,
    ( ~ spl6_1
    | spl6_2 ),
    inference(avatar_split_clause,[],[f58,f64,f60]) ).

fof(f58,plain,
    ( v_x = sF4(sF0)
    | v_f(v_xa(sF0)) != sF4(sF0) ),
    inference(superposition,[],[f41,f49]) ).

fof(f41,plain,
    ! [X0] :
      ( sF4(X0) != v_f(sF5(X0))
      | v_x = sF4(X0) ),
    inference(superposition,[],[f11,f24]) ).

fof(f24,plain,
    ! [X0] : sF3(sF4(X0)) = v_f(sF5(X0)),
    inference(superposition,[],[f10,f13]) ).

fof(f10,plain,
    ! [X0] : v_f(v_g(X0)) = sF3(X0),
    introduced(function_definition,[]) ).

fof(f11,plain,
    ! [X0] :
      ( sF3(X0) != X0
      | v_x = X0 ),
    inference(definition_folding,[],[f2,f10]) ).

fof(f2,axiom,
    ! [X0] :
      ( v_x = X0
      | v_f(v_g(X0)) != X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem    : SET838-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/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.14/0.34  % Computer : n002.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 14:35:29 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.49  % (22065)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.50  % (22074)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.20/0.50  % (22074)First to succeed.
% 0.20/0.50  % (22074)Refutation found. Thanks to Tanya!
% 0.20/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50  % (22074)------------------------------
% 0.20/0.50  % (22074)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50  % (22074)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50  % (22074)Termination reason: Refutation
% 0.20/0.50  
% 0.20/0.50  % (22074)Memory used [KB]: 5373
% 0.20/0.50  % (22074)Time elapsed: 0.102 s
% 0.20/0.50  % (22074)Instructions burned: 3 (million)
% 0.20/0.50  % (22074)------------------------------
% 0.20/0.50  % (22074)------------------------------
% 0.20/0.50  % (22059)Success in time 0.152 s
%------------------------------------------------------------------------------