TSTP Solution File: LCL236-3 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : LCL236-3 : TPTP v8.1.0. Released v2.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 : n001.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:31 EDT 2022

% Result   : Unsatisfiable 1.38s 0.53s
% Output   : Refutation 1.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   31 (  21 unt;   0 def)
%            Number of atoms       :   43 (   2 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  11   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   45 (  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f89,plain,
    $false,
    inference(avatar_sat_refutation,[],[f77,f88]) ).

fof(f88,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f85]) ).

fof(f85,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f80,f15]) ).

fof(f15,plain,
    ~ theorem(or(not(or(not(p),not(q))),not(not(or(not(p),not(q)))))),
    inference(definition_unfolding,[],[f10,f6,f9]) ).

fof(f9,axiom,
    ! [X6,X5] : and(X5,X6) = not(or(not(X5),not(X6))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_defn) ).

fof(f6,axiom,
    ! [X3,X4] : implies(X3,X4) = or(not(X3),X4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f10,axiom,
    ~ theorem(implies(or(not(p),not(q)),not(and(p,q)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f80,plain,
    ( ! [X1] : theorem(or(X1,not(X1)))
    | ~ spl0_3 ),
    inference(resolution,[],[f72,f26]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f20,f17]) ).

fof(f17,plain,
    ! [X3,X4] :
      ( ~ theorem(or(not(X4),X3))
      | theorem(X3)
      | ~ theorem(X4) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f8,axiom,
    ! [X3,X4] :
      ( ~ theorem(X4)
      | theorem(X3)
      | ~ theorem(implies(X4,X3)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f20,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

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

fof(f14,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

fof(f72,plain,
    ( ! [X0] : theorem(or(not(X0),X0))
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f71]) ).

fof(f71,plain,
    ( spl0_3
  <=> ! [X0] : theorem(or(not(X0),X0)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f77,plain,
    spl0_3,
    inference(avatar_split_clause,[],[f68,f71]) ).

fof(f68,plain,
    ! [X4] : theorem(or(not(X4),X4)),
    inference(resolution,[],[f60,f21]) ).

fof(f21,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f17,f18]) ).

fof(f18,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f12,f7]) ).

fof(f12,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

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

fof(f60,plain,
    ! [X10,X11] : theorem(or(X10,or(not(X11),X11))),
    inference(resolution,[],[f52,f19]) ).

fof(f19,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f13,f7]) ).

fof(f13,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

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

fof(f52,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f25,f17]) ).

fof(f25,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f11,f7]) ).

fof(f11,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : LCL236-3 : TPTP v8.1.0. Released v2.3.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.34  % Computer : n001.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 02:08:45 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (25169)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.50  % (25161)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.20/0.51  % (25153)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52  TRYING [1]
% 0.20/0.52  TRYING [2]
% 0.20/0.52  % (25149)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.52  % (25152)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.52  TRYING [3]
% 0.20/0.52  % (25154)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.38/0.52  % (25154)First to succeed.
% 1.38/0.53  % (25169)Also succeeded, but the first one will report.
% 1.38/0.53  % (25154)Refutation found. Thanks to Tanya!
% 1.38/0.53  % SZS status Unsatisfiable for theBenchmark
% 1.38/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 1.38/0.53  % (25154)------------------------------
% 1.38/0.53  % (25154)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.38/0.53  % (25154)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.38/0.53  % (25154)Termination reason: Refutation
% 1.38/0.53  
% 1.38/0.53  % (25154)Memory used [KB]: 5373
% 1.38/0.53  % (25154)Time elapsed: 0.123 s
% 1.38/0.53  % (25154)Instructions burned: 3 (million)
% 1.38/0.53  % (25154)------------------------------
% 1.38/0.53  % (25154)------------------------------
% 1.38/0.53  % (25146)Success in time 0.181 s
%------------------------------------------------------------------------------