↑ 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  : DAT001_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n020.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:47:55 AM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   30 (  16   ~;  12   |;   1   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number arithmetic     :   75 (   9 atm;   0 fun;  53 num;  13 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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   2 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (  18   !;   0   ?;  18   :)

% 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(f2,axiom,
    ! [X0: $int] : sorted(mycons(X0,nil)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_is_sorted) ).

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

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

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

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

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

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

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

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

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

tff(f26,plain,
    ! [X0: $int] : ~ sorted(mycons(X0,nil)),
    inference(consistent_polarity_flipping,[],[f22]) ).

tff(f27,plain,
    ! [X2: list,X0: $int,X1: $int] :
      ( ~ sorted(mycons(X0,mycons(X1,X2)))
      | ~ $less(X0,X1)
      | sorted(mycons(X1,X2)) ),
    inference(consistent_polarity_flipping,[],[f23]) ).

tff(f28,plain,
    sorted(mycons(1,mycons(2,mycons(4,mycons(7,mycons(100,nil)))))),
    inference(consistent_polarity_flipping,[],[f24]) ).

tff(f125,plain,
    ( ~ $less(1,2)
    | sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))) ),
    inference(resolution,[],[f27,f28]) ).

tff(f126,plain,
    sorted(mycons(2,mycons(4,mycons(7,mycons(100,nil))))),
    inference(evaluation,[],[f125]) ).

tff(f127,plain,
    ( ~ $less(2,4)
    | sorted(mycons(4,mycons(7,mycons(100,nil)))) ),
    inference(resolution,[],[f126,f27]) ).

tff(f128,plain,
    sorted(mycons(4,mycons(7,mycons(100,nil)))),
    inference(evaluation,[],[f127]) ).

tff(f129,plain,
    ( ~ $less(4,7)
    | sorted(mycons(7,mycons(100,nil))) ),
    inference(resolution,[],[f128,f27]) ).

tff(f130,plain,
    sorted(mycons(7,mycons(100,nil))),
    inference(evaluation,[],[f129]) ).

tff(f131,plain,
    ( ~ $less(7,100)
    | sorted(mycons(100,nil)) ),
    inference(resolution,[],[f130,f27]) ).

tff(f132,plain,
    sorted(mycons(100,nil)),
    inference(evaluation,[],[f131]) ).

tff(f133,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f132,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : DAT001_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.17  % Computer : n020.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 00:05:49 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.26  % (696065)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (696072)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=702206831:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (696071)% WARNING: option uhcvi not known.
% 0.08/0.26  % (696070)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1042010577_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % (696073)dis+10_1_sil=32000:sp=arity:random_seed=3778383460:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (696071)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3551123242:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (696070)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.08/0.26  % (696075)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3712936126:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26  % (696070)Terminated due to inappropriate strategy.
% 0.08/0.26  % (696070)------------------------------
% 0.08/0.26  % (696070)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (696070)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (696070)CaDiCaL version: 2.1.3
% 0.08/0.26  % (696070)Termination reason: Inappropriate
% 0.08/0.26  % (696070)Time elapsed: 0.0000 s
% 0.08/0.26  % (696070)Peak memory usage: 10 MB
% 0.08/0.26  % (696074)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2576050582:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (696076)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3039377514:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26  % (696070)------------------------------
% 0.08/0.26  % (696070)------------------------------
% 0.08/0.26  % (696071) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-696065-696071"...
% 0.08/0.26  % (696073) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-696065-696073"...
% 0.08/0.26  % (696071)...printing done.
% 0.08/0.26  % (696073)...printing done.
% 0.08/0.26  % (696074) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-696065-696074"...
% 0.08/0.26  % (696071)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (696071)------------------------------
% 0.08/0.26  % (696071)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (696071)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (696071)CaDiCaL version: 2.1.3
% 0.08/0.26  % (696071)Termination reason: Refutation
% 0.08/0.26  % (696071)Time elapsed: 0.005 s
% 0.08/0.26  % (696071)Peak memory usage: 12 MB
% 0.08/0.26  % (696071)Instructions burned: 5 (million)
% 0.08/0.26  % (696065)Success in time 0.042 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------