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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL506+1 : TPTP v8.1.0. Released v3.3.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 : n025.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 17:48:34 EDT 2022

% Result   : Theorem 0.19s 0.45s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   31 (   9 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  17   ~;  12   |;   0   &)
%                                         (   8 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    8 (   7 usr;   7 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (  20   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f159,plain,
    $false,
    inference(avatar_sat_refutation,[],[f128,f137,f138,f149,f158]) ).

fof(f158,plain,
    ( ~ spl2_4
    | spl2_6 ),
    inference(avatar_contradiction_clause,[],[f157]) ).

fof(f157,plain,
    ( $false
    | ~ spl2_4
    | spl2_6 ),
    inference(resolution,[],[f136,f127]) ).

fof(f127,plain,
    ( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f126]) ).

fof(f126,plain,
    ( spl2_4
  <=> ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

fof(f136,plain,
    ( ~ is_a_theorem(implies(and(sK1,sK0),sK1))
    | spl2_6 ),
    inference(avatar_component_clause,[],[f134]) ).

fof(f134,plain,
    ( spl2_6
  <=> is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_6])]) ).

fof(f149,plain,
    spl2_3,
    inference(avatar_split_clause,[],[f95,f122]) ).

fof(f122,plain,
    ( spl2_3
  <=> kn2 ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f95,plain,
    kn2,
    inference(cnf_transformation,[],[f37]) ).

fof(f37,axiom,
    kn2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn2) ).

fof(f138,plain,
    ~ spl2_5,
    inference(avatar_split_clause,[],[f97,f130]) ).

fof(f130,plain,
    ( spl2_5
  <=> and_1 ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_5])]) ).

fof(f97,plain,
    ~ and_1,
    inference(cnf_transformation,[],[f63]) ).

fof(f63,plain,
    ~ and_1,
    inference(flattening,[],[f44]) ).

fof(f44,negated_conjecture,
    ~ and_1,
    inference(negated_conjecture,[],[f43]) ).

fof(f43,conjecture,
    and_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_1) ).

fof(f137,plain,
    ( spl2_5
    | ~ spl2_6 ),
    inference(avatar_split_clause,[],[f92,f134,f130]) ).

fof(f92,plain,
    ( ~ is_a_theorem(implies(and(sK1,sK0),sK1))
    | and_1 ),
    inference(cnf_transformation,[],[f87]) ).

fof(f87,plain,
    ( and_1
    | ~ is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f82,f86]) ).

fof(f86,plain,
    ( ? [X0,X1] : ~ is_a_theorem(implies(and(X1,X0),X1))
   => ~ is_a_theorem(implies(and(sK1,sK0),sK1)) ),
    introduced(choice_axiom,[]) ).

fof(f82,plain,
    ( and_1
    | ? [X0,X1] : ~ is_a_theorem(implies(and(X1,X0),X1)) ),
    inference(ennf_transformation,[],[f71]) ).

fof(f71,plain,
    ( ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1))
   => and_1 ),
    inference(unused_predicate_definition_removal,[],[f66]) ).

fof(f66,plain,
    ( and_1
  <=> ! [X1,X0] : is_a_theorem(implies(and(X1,X0),X1)) ),
    inference(rectify,[],[f7]) ).

fof(f7,axiom,
    ( and_1
  <=> ! [X1,X0] : is_a_theorem(implies(and(X0,X1),X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_1) ).

fof(f128,plain,
    ( ~ spl2_3
    | spl2_4 ),
    inference(avatar_split_clause,[],[f93,f126,f122]) ).

fof(f93,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(and(X0,X1),X0))
      | ~ kn2 ),
    inference(cnf_transformation,[],[f77]) ).

fof(f77,plain,
    ( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
    | ~ kn2 ),
    inference(ennf_transformation,[],[f69]) ).

fof(f69,plain,
    ( kn2
   => ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0)) ),
    inference(unused_predicate_definition_removal,[],[f67]) ).

fof(f67,plain,
    ( ! [X0,X1] : is_a_theorem(implies(and(X0,X1),X0))
  <=> kn2 ),
    inference(rectify,[],[f17]) ).

fof(f17,axiom,
    ( ! [X3,X4] : is_a_theorem(implies(and(X3,X4),X3))
  <=> kn2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : LCL506+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33  % Computer : n025.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 02:14:29 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.44  % (27644)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.45  % (27636)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.19/0.45  % (27644)First to succeed.
% 0.19/0.45  % (27636)Also succeeded, but the first one will report.
% 0.19/0.45  % (27644)Refutation found. Thanks to Tanya!
% 0.19/0.45  % SZS status Theorem for theBenchmark
% 0.19/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.45  % (27644)------------------------------
% 0.19/0.45  % (27644)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.45  % (27644)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.45  % (27644)Termination reason: Refutation
% 0.19/0.45  
% 0.19/0.45  % (27644)Memory used [KB]: 5500
% 0.19/0.45  % (27644)Time elapsed: 0.052 s
% 0.19/0.45  % (27644)Instructions burned: 2 (million)
% 0.19/0.45  % (27644)------------------------------
% 0.19/0.45  % (27644)------------------------------
% 0.19/0.45  % (27617)Success in time 0.112 s
%------------------------------------------------------------------------------