TSTP Solution File: DAT093_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT093_1 : TPTP v8.1.0. Released v6.1.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 : n021.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 16:04:09 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   30 (  14 unt;  16 typ;   0 def)
%            Number of atoms       :   14 (  13 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number arithmetic     :   26 (   0 atm;  13 fun;  13 num;   0 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :   25 (  14   >;  11   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   16 (  13 usr;   3 con; 0-2 aty)
%            Number of variables   :   14 (  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    list: $tType ).

tff(func_def_0,type,
    nil: list ).

tff(func_def_1,type,
    cons: ( $int * list ) > list ).

tff(func_def_2,type,
    head: list > $int ).

tff(func_def_3,type,
    tail: list > list ).

tff(func_def_5,type,
    length: list > $int ).

tff(func_def_8,type,
    count: ( $int * list ) > $int ).

tff(func_def_9,type,
    append: ( list * list ) > list ).

tff(func_def_11,type,
    sK0: ( $int * list ) > $int ).

tff(func_def_12,type,
    sK1: ( $int * list ) > list ).

tff(func_def_13,type,
    sK2: ( $int * list ) > $int ).

tff(func_def_14,type,
    sK3: ( $int * list ) > list ).

tff(func_def_15,type,
    sK4: ( $int * list ) > $int ).

tff(func_def_16,type,
    sK5: ( $int * list ) > list ).

tff(pred_def_1,type,
    in: ( $int * list ) > $o ).

tff(pred_def_2,type,
    inRange: ( $int * list ) > $o ).

tff(f111,plain,
    $false,
    inference(evaluation,[],[f109]) ).

tff(f109,plain,
    0 = $sum(1,0),
    inference(superposition,[],[f101,f82]) ).

tff(f82,plain,
    0 = length(nil),
    inference(cnf_transformation,[],[f7]) ).

tff(f7,axiom,
    0 = length(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).

tff(f101,plain,
    ! [X1: list] : ( length(X1) = $sum(1,length(X1)) ),
    inference(forward_demodulation,[],[f100,f87]) ).

tff(f87,plain,
    ! [X0: list] : ( append(nil,X0) = X0 ),
    inference(cnf_transformation,[],[f36]) ).

tff(f36,plain,
    ! [X0: list] : ( append(nil,X0) = X0 ),
    inference(rectify,[],[f12]) ).

tff(f12,axiom,
    ! [X1: list] : ( append(nil,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_6) ).

tff(f100,plain,
    ! [X1: list] : ( length(append(nil,X1)) = $sum(1,length(X1)) ),
    inference(evaluation,[],[f98]) ).

tff(f98,plain,
    ! [X1: list] : ( length(append(nil,X1)) = $sum($sum(0,length(X1)),1) ),
    inference(superposition,[],[f89,f82]) ).

tff(f89,plain,
    ! [X0: list,X1: list] : ( length(append(X0,X1)) = $sum($sum(length(X0),length(X1)),1) ),
    inference(cnf_transformation,[],[f39]) ).

tff(f39,plain,
    ! [X0: list,X1: list] : ( length(append(X0,X1)) = $sum($sum(length(X0),length(X1)),1) ),
    inference(flattening,[],[f16]) ).

tff(f16,negated_conjecture,
    ~ ~ ! [X0: list,X1: list] : ( length(append(X0,X1)) = $sum($sum(length(X0),length(X1)),1) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    ~ ! [X0: list,X1: list] : ( length(append(X0,X1)) = $sum($sum(length(X0),length(X1)),1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : DAT093=1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/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.13/0.34  % Computer : n021.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   : Mon Aug 29 20:18:10 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  % (6205)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=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50  % (6206)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.50  % (6219)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51  % (6210)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.20/0.51  % (6227)lrs+1_1:10_av=off:drc=off:nwc=2.0:sp=reverse_frequency:thsq=on:thsqc=64:thsql=off:i=47:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/47Mi)
% 0.20/0.51  % (6206)First to succeed.
% 0.20/0.51  % (6219)Instruction limit reached!
% 0.20/0.51  % (6219)------------------------------
% 0.20/0.51  % (6219)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (6206)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (6206)------------------------------
% 0.20/0.51  % (6206)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (6206)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (6206)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (6206)Memory used [KB]: 5628
% 0.20/0.51  % (6206)Time elapsed: 0.114 s
% 0.20/0.51  % (6206)Instructions burned: 5 (million)
% 0.20/0.51  % (6206)------------------------------
% 0.20/0.51  % (6206)------------------------------
% 0.20/0.51  % (6198)Success in time 0.167 s
%------------------------------------------------------------------------------