TSTP Solution File: LCL397-1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : LCL397-1 : 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_uns --cores 0 -t %d %s

% Computer : n010.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:41:51 EDT 2022

% Result   : Unsatisfiable 0.19s 0.57s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   24 (  13   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f168,plain,
    $false,
    inference(subsumption_resolution,[],[f167,f23]) ).

fof(f23,plain,
    ! [X0] : is_a_theorem(implies(X0,X0)),
    inference(resolution,[],[f18,f3]) ).

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).

fof(f18,plain,
    ! [X6,X4,X5] :
      ( ~ is_a_theorem(implies(implies(not(X4),X6),X5))
      | is_a_theorem(implies(X4,X5)) ),
    inference(resolution,[],[f13,f1]) ).

fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(X1)
      | ~ is_a_theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f13,plain,
    ! [X8,X6,X7] : is_a_theorem(implies(implies(implies(not(X6),X7),X8),implies(X6,X8))),
    inference(resolution,[],[f10,f4]) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

fof(f10,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X2,X0))
      | is_a_theorem(implies(implies(X0,X1),implies(X2,X1))) ),
    inference(resolution,[],[f2,f1]) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

fof(f167,plain,
    ~ is_a_theorem(implies(y,y)),
    inference(resolution,[],[f151,f5]) ).

fof(f5,axiom,
    ~ is_a_theorem(implies(x,implies(y,y))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_63) ).

fof(f151,plain,
    ! [X6,X5] :
      ( is_a_theorem(implies(X6,X5))
      | ~ is_a_theorem(X5) ),
    inference(resolution,[],[f136,f18]) ).

fof(f136,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X1,X0),X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f49,f3]) ).

fof(f49,plain,
    ! [X8,X6,X7,X5] :
      ( ~ is_a_theorem(implies(implies(not(X5),X7),X8))
      | ~ is_a_theorem(X5)
      | is_a_theorem(implies(implies(X6,X7),X8)) ),
    inference(resolution,[],[f19,f1]) ).

fof(f19,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(implies(X3,X1),X2)))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f14,f10]) ).

fof(f14,plain,
    ! [X10,X11,X9] :
      ( is_a_theorem(implies(implies(X9,X10),implies(not(X11),X10)))
      | ~ is_a_theorem(X11) ),
    inference(resolution,[],[f10,f7]) ).

fof(f7,plain,
    ! [X2,X1] :
      ( is_a_theorem(implies(not(X1),X2))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f1,f4]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : LCL397-1 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.34  % Computer : n010.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % 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 01:50:29 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.53  % (10002)lrs+1011_1:1_atotf=0.0306256:ep=RST:mep=off:nm=0:sos=all:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.19/0.55  % (10000)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.55  % (10002)Instruction limit reached!
% 0.19/0.55  % (10002)------------------------------
% 0.19/0.55  % (10002)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.55  % (10002)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.55  % (10002)Termination reason: Unknown
% 0.19/0.55  % (10002)Termination phase: Saturation
% 0.19/0.55  
% 0.19/0.55  % (10002)Memory used [KB]: 5756
% 0.19/0.55  % (10002)Time elapsed: 0.122 s
% 0.19/0.55  % (10002)Instructions burned: 3 (million)
% 0.19/0.55  % (10002)------------------------------
% 0.19/0.55  % (10002)------------------------------
% 0.19/0.55  % (10000)First to succeed.
% 0.19/0.55  % (10016)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=97:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/97Mi)
% 0.19/0.55  % (10018)dis+10_1:1_add=large:alpa=false:anc=none:fd=off:lcm=reverse:nwc=5.0:sd=2:sgt=20:ss=included:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.19/0.55  % (10010)lrs+1_1:1_aac=none:add=large:anc=all_dependent:cond=fast:ep=RST:fsr=off:lma=on:nm=2:sos=on:sp=reverse_arity:stl=30:uhcvi=on:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.56  % (10010)Instruction limit reached!
% 0.19/0.56  % (10010)------------------------------
% 0.19/0.56  % (10010)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56  % (10010)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56  % (10008)dis+1011_3:29_av=off:awrs=decay:awrsf=32:bce=on:drc=off:fde=unused:gsp=on:irw=on:nwc=2.0:spb=goal_then_units:updr=off:urr=ec_only:i=29:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/29Mi)
% 0.19/0.56  % (10010)Termination reason: Unknown
% 0.19/0.56  % (10010)Termination phase: Saturation
% 0.19/0.56  
% 0.19/0.56  % (10010)Memory used [KB]: 5756
% 0.19/0.56  % (10010)Time elapsed: 0.131 s
% 0.19/0.56  % (10010)Instructions burned: 2 (million)
% 0.19/0.56  % (10010)------------------------------
% 0.19/0.56  % (10010)------------------------------
% 0.19/0.57  % (10018)Also succeeded, but the first one will report.
% 0.19/0.57  % (10000)Refutation found. Thanks to Tanya!
% 0.19/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57  % (10000)------------------------------
% 0.19/0.57  % (10000)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.57  % (10000)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.57  % (10000)Termination reason: Refutation
% 0.19/0.57  
% 0.19/0.57  % (10000)Memory used [KB]: 1407
% 0.19/0.57  % (10000)Time elapsed: 0.131 s
% 0.19/0.57  % (10000)Instructions burned: 8 (million)
% 0.19/0.57  % (10000)------------------------------
% 0.19/0.57  % (10000)------------------------------
% 0.19/0.57  % (9993)Success in time 0.22 s
%------------------------------------------------------------------------------