↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : DAT083_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 09:48:06 AM UTC 2026

% Result   : Theorem 0.26s 0.32s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (  12 unt;   0 typ;   0 def)
%            Number of atoms       :   12 (  11 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   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     :   35 (   0 atm;   7 fun;  26 num;   2 var)
%            Number of types       :    3 (   1 usr;   1 ari;   0 dat;   0 cdt)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  13 usr;   5 con; 0-2 aty)
%            Number of variables   :    4 (   4   !;   0   ?;   4   :)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f71,plain,
    length(cons(1,cons(2,nil))) = 3,
    inference(cnf_transformation,[],[f34]) ).

tff(f126,plain,
    3 = $sum(1,length(cons(2,nil))),
    inference(superposition,[],[f71,f63]) ).

tff(f127,plain,
    3 = $sum(1,$sum(1,length(nil))),
    inference(forward_demodulation,[],[f126,f63]) ).

tff(f129,plain,
    3 = $sum(1,$sum(1,0)),
    inference(forward_demodulation,[],[f127,f62]) ).

tff(f130,plain,
    $false,
    inference(evaluation,[],[f129]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : DAT083_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  % Computer : n026.cluster.edu
% 0.10/0.23  % Model    : x86_64 x86_64
% 0.10/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.23  % Memory   : 8046.5625MB
% 0.10/0.23  % OS       : Linux 6.8.0-71-generic
% 0.10/0.23  % CPULimit : 300
% 0.10/0.23  % WCLimit  : 300
% 0.10/0.23  % DateTime : Tue Sep 29 00:10:57 UTC 2026
% 0.10/0.23  % CPUTime  : 
% 0.10/0.23  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.27  Running first-order model finding
% 0.10/0.27  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.26/0.32  % (217988)Will run a generic schedule for satisfiability detection.
% 0.26/0.32  % (217994)% WARNING: option uhcvi not known.
% 0.26/0.32  % (217996)dis+10_1_sil=32000:sp=arity:random_seed=4071328822:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.26/0.32  % (217995)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4055634032:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.26/0.32  % (217993)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3453131721_3000 on theBenchmark for (3000ds/0Mi)
% 0.26/0.32  % (217998)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1687698697:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.26/0.32  % (217993)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.26/0.32  % (217993)Terminated due to inappropriate strategy.
% 0.26/0.32  % (217993)------------------------------
% 0.26/0.32  % (217993)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.32  % (217993)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.32  % (217993)CaDiCaL version: 2.1.3
% 0.26/0.32  % (217993)Termination reason: Inappropriate
% 0.26/0.32  % (217993)Time elapsed: 0.002 s
% 0.26/0.32  % (217993)Peak memory usage: 10 MB
% 0.26/0.32  % (217993)Instructions burned: 1 (million)
% 0.26/0.32  % (217993)------------------------------
% 0.26/0.32  % (217993)------------------------------
% 0.26/0.32  % (217997)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3829417928:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.26/0.32  % (217994)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1723208029:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.26/0.32  % (217996) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-217988-217996"...
% 0.26/0.32  % (217999)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1089447009:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.26/0.32  % (217998) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-217988-217998"...
% 0.26/0.32  % (217996)...printing done.
% 0.26/0.32  % (217998)...printing done.
% 0.26/0.32  % (217996)Refutation found. Thanks to Tanya!
% 0.26/0.32  % SZS status Theorem for theBenchmark
% 0.26/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.32  % (217996)------------------------------
% 0.26/0.32  % (217996)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.32  % (217996)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.32  % (217996)CaDiCaL version: 2.1.3
% 0.26/0.32  % (217996)Termination reason: Refutation
% 0.26/0.32  % (217996)Time elapsed: 0.006 s
% 0.26/0.32  % (217996)Peak memory usage: 12 MB
% 0.26/0.32  % (217996)Instructions burned: 5 (million)
% 0.26/0.32  % (217988)Success in time 0.039 s
% 0.26/0.32  % Vampire exiting
%------------------------------------------------------------------------------