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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL176-1 : TPTP v8.1.0. Released v1.1.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 : n009.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:47:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f107,plain,
    $false,
    inference(avatar_sat_refutation,[],[f104,f106]) ).

fof(f106,plain,
    ~ spl2_4,
    inference(avatar_contradiction_clause,[],[f105]) ).

fof(f105,plain,
    ( $false
    | ~ spl2_4 ),
    inference(resolution,[],[f53,f12]) ).

fof(f12,plain,
    ~ theorem(sF1),
    inference(definition_folding,[],[f9,f11,f10]) ).

fof(f10,plain,
    not(p) = sF0,
    introduced(function_definition,[]) ).

fof(f11,plain,
    sF1 = or(sF0,p),
    introduced(function_definition,[]) ).

fof(f9,axiom,
    ~ theorem(or(not(p),p)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f53,plain,
    ( theorem(sF1)
    | ~ spl2_4 ),
    inference(avatar_component_clause,[],[f51]) ).

fof(f51,plain,
    ( spl2_4
  <=> theorem(sF1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_4])]) ).

fof(f104,plain,
    spl2_4,
    inference(avatar_split_clause,[],[f102,f51]) ).

fof(f102,plain,
    theorem(sF1),
    inference(resolution,[],[f98,f25]) ).

fof(f25,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f7,f1]) ).

fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f7,axiom,
    ! [X3,X4] :
      ( ~ axiom(or(not(X4),X3))
      | ~ theorem(X4)
      | theorem(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f98,plain,
    ! [X0] : theorem(or(X0,sF1)),
    inference(resolution,[],[f95,f19]) ).

fof(f19,plain,
    ! [X0] : theorem(or(sF0,or(X0,p))),
    inference(resolution,[],[f15,f6]) ).

fof(f6,axiom,
    ! [X3] :
      ( ~ axiom(X3)
      | theorem(X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

fof(f15,plain,
    ! [X0] : axiom(or(sF0,or(X0,p))),
    inference(superposition,[],[f2,f10]) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f95,plain,
    ! [X0] :
      ( ~ theorem(or(sF0,or(X0,p)))
      | theorem(or(X0,sF1)) ),
    inference(resolution,[],[f87,f7]) ).

fof(f87,plain,
    ! [X0] : axiom(or(not(or(sF0,or(X0,p))),or(X0,sF1))),
    inference(superposition,[],[f4,f11]) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_5) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL176-1 : TPTP v8.1.0. Released v1.1.0.
% 0.11/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 : n009.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 01:38:05 EDT 2022
% 0.14/0.34  % CPUTime    : 
% 0.20/0.50  % (11611)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.50  % (11619)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50  % (11619)First to succeed.
% 0.20/0.51  % (11618)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51  % (11612)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51  % (11619)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (11619)------------------------------
% 0.20/0.51  % (11619)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (11619)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (11619)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (11619)Memory used [KB]: 5373
% 0.20/0.51  % (11619)Time elapsed: 0.107 s
% 0.20/0.51  % (11619)Instructions burned: 3 (million)
% 0.20/0.51  % (11619)------------------------------
% 0.20/0.51  % (11619)------------------------------
% 0.20/0.51  % (11602)Success in time 0.16 s
%------------------------------------------------------------------------------