TSTP Solution File: LCL174-3 by SnakeForV---1.0

View Problem - Process Solution

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

% Computer : n014.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:39:10 EDT 2022

% Result   : Unsatisfiable 0.20s 0.60s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   16 (   9 unt;   1 typ;   0 def)
%            Number of atoms       :  150 (   1 equ)
%            Maximal formula atoms :    3 (  10 avg)
%            Number of connectives :   22 (  14   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  127 ( 127 fml;   0 var)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    2 (   1   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   4 prp; 0-3 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   23 (  22   !;   0   ?;  23   :)
%                                         (   1  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
tff(pred_def_3,type,
    sQ0_eqProxy: 
      !>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).

tff(f33,plain,
    $false,
    inference(subsumption_resolution,[],[f30,f14]) ).

tff(f14,plain,
    ! [X2: $i,X0: $i,X1: $i] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

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

tff(f5,axiom,
    ! [X2: $i,X0: $i,X1: $i] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_6) ).

tff(f30,plain,
    ~ axiom(or(not(or(not(q),r)),or(not(or(not(p),q)),or(not(p),r)))),
    inference(resolution,[],[f25,f11]) ).

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

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

tff(f25,plain,
    ! [X0: $i] :
      ( ~ axiom(or(not(X0),or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))))
      | ~ axiom(X0) ),
    inference(resolution,[],[f23,f7]) ).

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

tff(f23,plain,
    ! [X0: $i] :
      ( ~ theorem(X0)
      | ~ axiom(or(not(X0),or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r))))) ),
    inference(resolution,[],[f22,f7]) ).

tff(f22,plain,
    ! [X0: $i] :
      ( ~ theorem(or(not(X0),or(not(or(not(p),q)),or(not(or(not(q),r)),or(not(p),r)))))
      | ~ theorem(X0) ),
    inference(resolution,[],[f10,f12]) ).

tff(f12,plain,
    ! [X3: $i,X4: $i] :
      ( theorem(X3)
      | ~ theorem(or(not(X4),X3))
      | ~ theorem(X4) ),
    inference(definition_unfolding,[],[f8,f6]) ).

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

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

tff(f9,axiom,
    ~ theorem(implies(implies(p,q),implies(implies(q,r),implies(p,r)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem    : LCL174-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.14  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35  % Computer : n014.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 01:41:06 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.58  % (13524)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.20/0.59  % (13538)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.20/0.59  % (13540)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.20/0.59  % (13523)lrs+1010_1:4_amm=off:bce=on:sd=1:sos=on:ss=included:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.59  % (13530)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.20/0.59  % (13532)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.20/0.59  % (13522)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.20/0.59  % (13524)First to succeed.
% 0.20/0.60  % (13523)Refutation not found, incomplete strategy% (13523)------------------------------
% 0.20/0.60  % (13523)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60  % (13524)Refutation found. Thanks to Tanya!
% 0.20/0.60  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.60  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.60  % (13524)------------------------------
% 0.20/0.60  % (13524)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.60  % (13524)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.60  % (13524)Termination reason: Refutation
% 0.20/0.60  
% 0.20/0.60  % (13524)Memory used [KB]: 5756
% 0.20/0.60  % (13524)Time elapsed: 0.152 s
% 0.20/0.60  % (13524)Instructions burned: 2 (million)
% 0.20/0.60  % (13524)------------------------------
% 0.20/0.60  % (13524)------------------------------
% 0.20/0.60  % (13485)Success in time 0.238 s
%------------------------------------------------------------------------------