TSTP Solution File: DAT001_1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : DAT001_1 : TPTP v8.1.0. Released v5.0.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 : n005.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:03:51 EDT 2022

% Result   : Theorem 0.20s 0.53s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  11 unt;   4 typ;   0 def)
%            Number of atoms       :   34 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  21   ~;  10   |;   2   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number arithmetic     :   69 (   9 atm;   0 fun;  48 num;  12 var)
%            Number of types       :    3 (   1 usr;   1 ari)
%            Number of type conns  :    3 (   2   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   2 usr;   6 con; 0-2 aty)
%            Number of variables   :   17 (  17   !;   0   ?;  17   :)

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

tff(func_def_0,type,
    nil: list ).

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

tff(pred_def_1,type,
    sorted: list > $o ).

tff(f48,plain,
    $false,
    inference(resolution,[],[f46,f23]) ).

tff(f23,plain,
    ! [X0: $int] : sorted(mycons(X0,nil)),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    ! [X0: $int] : sorted(mycons(X0,nil)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_is_sorted) ).

tff(f46,plain,
    ~ sorted(mycons(100,nil)),
    inference(evaluation,[],[f45]) ).

tff(f45,plain,
    ( ~ $less(7,100)
    | ~ sorted(mycons(100,nil)) ),
    inference(resolution,[],[f36,f25]) ).

tff(f25,plain,
    ! [X2: $int,X0: $int,X1: list] :
      ( sorted(mycons(X0,mycons(X2,X1)))
      | ~ sorted(mycons(X2,X1))
      | ~ $less(X0,X2) ),
    inference(cnf_transformation,[],[f21]) ).

tff(f21,plain,
    ! [X0: $int,X1: list,X2: $int] :
      ( ~ sorted(mycons(X2,X1))
      | sorted(mycons(X0,mycons(X2,X1)))
      | ~ $less(X0,X2) ),
    inference(flattening,[],[f20]) ).

tff(f20,plain,
    ! [X0: $int,X1: list,X2: $int] :
      ( sorted(mycons(X0,mycons(X2,X1)))
      | ~ $less(X0,X2)
      | ~ sorted(mycons(X2,X1)) ),
    inference(ennf_transformation,[],[f18]) ).

tff(f18,plain,
    ! [X0: $int,X1: list,X2: $int] :
      ( ( $less(X0,X2)
        & sorted(mycons(X2,X1)) )
     => sorted(mycons(X0,mycons(X2,X1))) ),
    inference(rectify,[],[f3]) ).

tff(f3,axiom,
    ! [X0: $int,X2: list,X1: $int] :
      ( ( sorted(mycons(X1,X2))
        & $less(X0,X1) )
     => sorted(mycons(X0,mycons(X1,X2))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',recursive_sort) ).

tff(f36,plain,
    ~ sorted(mycons(7,mycons(100,nil))),
    inference(evaluation,[],[f35]) ).

tff(f35,plain,
    ( ~ $less(4,7)
    | ~ sorted(mycons(7,mycons(100,nil))) ),
    inference(resolution,[],[f33,f25]) ).

tff(f33,plain,
    ~ sorted(mycons(4,mycons(7,mycons(100,nil)))),
    inference(evaluation,[],[f32]) ).

tff(f32,plain,
    ( ~ sorted(mycons(4,mycons(7,mycons(100,nil))))
    | ~ $less(2,4) ),
    inference(resolution,[],[f31,f25]) ).

tff(f31,plain,
    ~ sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))),
    inference(evaluation,[],[f30]) ).

tff(f30,plain,
    ( ~ sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil)))))
    | ~ $less(1,2) ),
    inference(resolution,[],[f25,f22]) ).

tff(f22,plain,
    ~ sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
    inference(cnf_transformation,[],[f19]) ).

tff(f19,plain,
    ~ sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
    inference(flattening,[],[f5]) ).

tff(f5,negated_conjecture,
    ~ sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
    inference(negated_conjecture,[],[f4]) ).

tff(f4,conjecture,
    sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',check_list) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : DAT001=1 : TPTP v8.1.0. Released v5.0.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.12/0.34  % Computer : n005.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   : Mon Aug 29 20:14:48 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.20/0.52  % (7221)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.20/0.52  % (7216)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52  % (7211)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.20/0.52  % (7221)First to succeed.
% 0.20/0.53  % (7229)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.20/0.53  % (7216)Instruction limit reached!
% 0.20/0.53  % (7216)------------------------------
% 0.20/0.53  % (7216)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (7223)lrs+10_1:1_sd=10:sos=all:ss=axioms:st=5.0:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.53  % (7204)dis+1010_1:4_aac=none:abs=on:atotf=0.5:avsq=on:avsqc=2:avsqr=215,247:awrs=converge:awrsf=128:bsd=on:erd=off:fde=none:gve=cautious:newcnf=on:nwc=5.0:rnwc=on:sac=on:sas=z3:sp=const_min:tgt=ground:thsq=on:thsqc=64:thsqr=1,4:i=59848:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59848Mi)
% 0.20/0.53  % (7211)Also succeeded, but the first one will report.
% 0.20/0.53  % (7216)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (7221)Refutation found. Thanks to Tanya!
% 0.20/0.53  % SZS status Theorem for theBenchmark
% 0.20/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53  % (7221)------------------------------
% 0.20/0.53  % (7221)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53  % (7221)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53  % (7221)Termination reason: Refutation
% 0.20/0.53  
% 0.20/0.53  % (7221)Memory used [KB]: 5500
% 0.20/0.53  % (7221)Time elapsed: 0.117 s
% 0.20/0.53  % (7221)Instructions burned: 2 (million)
% 0.20/0.53  % (7221)------------------------------
% 0.20/0.53  % (7221)------------------------------
% 0.20/0.53  % (7203)Success in time 0.182 s
%------------------------------------------------------------------------------