TSTP Solution File: DAT082_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT082_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 : n024.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:07 EDT 2022

% Result   : Theorem 0.21s 0.50s
% Output   : Refutation 0.21s
% 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 :    7 (   7   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number arithmetic     :   33 (   0 atm;   5 fun;  25 num;   3 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    :   17 (  13 usr;   4 con; 0-2 aty)
%            Number of variables   :    6 (   6   !;   0   ?;   6   :)

% 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_12,type,
    sK0: ( $int * list ) > list ).

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

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

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

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

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

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

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

tff(f97,plain,
    $false,
    inference(subsumption_resolution,[],[f96,f69]) ).

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

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

tff(f96,plain,
    0 != length(nil),
    inference(cancellation,[],[f95]) ).

tff(f95,plain,
    1 != $sum(1,length(nil)),
    inference(forward_demodulation,[],[f94,f80]) ).

tff(f80,plain,
    ! [X0: list,X1: $int] : ( $sum(1,length(X0)) = length(cons(X1,X0)) ),
    inference(cnf_transformation,[],[f32]) ).

tff(f32,plain,
    ! [X0: list,X1: $int] : ( $sum(1,length(X0)) = length(cons(X1,X0)) ),
    inference(rectify,[],[f8]) ).

tff(f8,axiom,
    ! [X4: list,X3: $int] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1) ).

tff(f94,plain,
    1 != length(cons(2,nil)),
    inference(cancellation,[],[f93]) ).

tff(f93,plain,
    2 != $sum(1,length(cons(2,nil))),
    inference(forward_demodulation,[],[f70,f80]) ).

tff(f70,plain,
    2 != length(cons(1,cons(2,nil))),
    inference(cnf_transformation,[],[f39]) ).

tff(f39,plain,
    2 != length(cons(1,cons(2,nil))),
    inference(flattening,[],[f16]) ).

tff(f16,negated_conjecture,
    ( ( ~ 2 )
    = length(cons(1,cons(2,nil))) ),
    inference(negated_conjecture,[],[f15]) ).

tff(f15,conjecture,
    2 = length(cons(1,cons(2,nil))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem    : DAT082=1 : TPTP v8.1.0. Released v6.1.0.
% 0.12/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 : n024.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   : Mon Aug 29 20:23:19 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  % (16416)lrs+10_1:1_canc=force:tha=some:to=lpo:i=35:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/35Mi)
% 0.21/0.50  % (16432)lrs+1002_1:1_br=off:canc=force:drc=off:s2a=on:sos=on:sp=reverse_frequency:urr=on:i=42:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/42Mi)
% 0.21/0.50  % (16432)First to succeed.
% 0.21/0.50  % (16432)Refutation found. Thanks to Tanya!
% 0.21/0.50  % SZS status Theorem for theBenchmark
% 0.21/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50  % (16432)------------------------------
% 0.21/0.50  % (16432)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50  % (16432)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50  % (16432)Termination reason: Refutation
% 0.21/0.50  
% 0.21/0.50  % (16432)Memory used [KB]: 5500
% 0.21/0.50  % (16432)Time elapsed: 0.004 s
% 0.21/0.50  % (16432)Instructions burned: 3 (million)
% 0.21/0.50  % (16432)------------------------------
% 0.21/0.50  % (16432)------------------------------
% 0.21/0.50  % (16401)Success in time 0.146 s
%------------------------------------------------------------------------------