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

% Computer : n005.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:34:59 AM UTC 2026

% Result   : Theorem 0.11s 0.27s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ARI620_1 : TPTP v9.3.1. Released v5.1.0.
% 0.00/0.04  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.17  % Computer : n005.cluster.edu
% 0.11/0.17  % Model    : x86_64 x86_64
% 0.11/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.17  % Memory   : 8046.5625MB
% 0.11/0.17  % OS       : Linux 6.8.0-71-generic
% 0.11/0.17  % CPULimit : 300
% 0.11/0.17  % WCLimit  : 300
% 0.11/0.17  % DateTime : Mon Sep 28 20:53:46 UTC 2026
% 0.11/0.17  % CPUTime  : 
% 0.11/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.20  Running first-order model finding
% 0.11/0.20  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.11/0.27  % (1161192)Will run a generic schedule for satisfiability detection.
% 0.11/0.27  % (1161209)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1140201186:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.27  % (1161206)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3135278800_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.27  % (1161210)dis+10_1_sil=32000:sp=arity:random_seed=1941047039:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.27  % (1161211)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1134096919:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.27  % (1161206)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.11/0.27  % (1161206)Terminated due to inappropriate strategy.
% 0.11/0.27  % (1161206)------------------------------
% 0.11/0.27  % (1161206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.27  % (1161206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.27  % (1161206)CaDiCaL version: 2.1.3
% 0.11/0.27  % (1161206)Termination reason: Inappropriate
% 0.11/0.27  % (1161206)Time elapsed: 0.001 s
% 0.11/0.27  % (1161206)Peak memory usage: 10 MB
% 0.11/0.27  % (1161212)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3238334139:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.27  % (1161213)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=593632349:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.27  % (1161206)------------------------------
% 0.11/0.27  % (1161206)------------------------------
% 0.11/0.27  % (1161207)% WARNING: option uhcvi not known.
% 0.11/0.27  % (1161207)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=397771150:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.27  % (1161207) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1161192-1161207"...
% 0.11/0.27  % (1161207)...printing done.
% 0.11/0.27  % (1161207)Refutation found. Thanks to Tanya!
% 0.11/0.27  % SZS status Theorem for theBenchmark
% 0.11/0.27  % SZS output start Proof for theBenchmark
% 0.11/0.27  tff(func_def_7, type, sK0: $int > $int).
% 0.11/0.27  tff(pred_def_1, type, pow2: $int > $o).
% 0.11/0.27  tff(f1,conjecture,(
% 0.11/0.27    ! [X0 : $int] : (pow2(X0) <=> (X0 = 1 | ($lesseq(2,X0) & ? [X1 : $int] : ($product(2,X1) = X0 & pow2(X1))))) => pow2(8)),
% 0.11/0.27    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pow_of_2_8)).
% 0.11/0.27  tff(f2,negated_conjecture,(
% 0.11/0.27    ~(! [X0 : $int] : (pow2(X0) <=> (X0 = 1 | ($lesseq(2,X0) & ? [X1 : $int] : ($product(2,X1) = X0 & pow2(X1))))) => pow2(8))),
% 0.11/0.27    inference(negated_conjecture,[status(cth)],[f1])).
% 0.11/0.27  tff(f3,plain,(
% 0.11/0.27    ~(! [X0 : $int] : (pow2(X0) <=> (X0 = 1 | (~$less(X0,2) & ? [X1 : $int] : ($product(2,X1) = X0 & pow2(X1))))) => pow2(8))),
% 0.11/0.27    inference(theory_normalization,[],[f2])).
% 0.11/0.27  tff(f15,definition,(
% 0.11/0.27    ( ! [X0 : $int,X1 : $int] : ($product(X0,X1) = $product(X1,X0)) )),
% 0.11/0.27    introduced(theory,[tha_commutativity])).
% 0.11/0.27  tff(f17,definition,(
% 0.11/0.27    ( ! [X0 : $int] : ($product(X0,1) = X0) )),
% 0.11/0.27    introduced(theory,[tha_right_identity])).
% 0.11/0.27  tff(f22,plain,(
% 0.11/0.27    ~pow2(8) & ! [X0 : $int] : (pow2(X0) <=> (X0 = 1 | (~$less(X0,2) & ? [X1 : $int] : ($product(2,X1) = X0 & pow2(X1)))))),
% 0.11/0.27    inference(ennf_transformation,[],[f3])).
% 0.11/0.27  tff(f25,plain,(
% 0.11/0.27    ( ! [X0 : $int,X1 : $int] : (~pow2(X1) | $product(2,X1) != X0 | $less(X0,2) | pow2(X0)) )),
% 0.11/0.27    inference(cnf_transformation,[],[f22])).
% 0.11/0.27  tff(f27,plain,(
% 0.11/0.27    ( ! [X0 : $int] : (1 != X0 | pow2(X0)) )),
% 0.11/0.27    inference(cnf_transformation,[],[f22])).
% 0.11/0.27  tff(f28,plain,(
% 0.11/0.27    ~pow2(8)),
% 0.11/0.27    inference(cnf_transformation,[],[f22])).
% 0.11/0.27  tff(f30,plain,(
% 0.11/0.27    pow2(1)),
% 0.11/0.27    inference(equality_resolution,[],[f27])).
% 0.11/0.27  tff(f31,plain,(
% 0.11/0.27    ( ! [X1 : $int] : (pow2($product(2,X1)) | $less($product(2,X1),2) | ~pow2(X1)) )),
% 0.11/0.27    inference(equality_resolution,[],[f25])).
% 0.11/0.27  tff(f42,plain,(
% 0.11/0.27    pow2(2) | $less(2,2) | ~pow2(1)),
% 0.11/0.27    inference(superposition,[],[f31,f17])).
% 0.11/0.27  tff(f43,plain,(
% 0.11/0.27    pow2(2) | ~pow2(1)),
% 0.11/0.27    inference(evaluation,[],[f42])).
% 0.11/0.27  tff(f44,plain,(
% 0.11/0.27    pow2(2)),
% 0.11/0.27    inference(forward_subsumption_resolution,[],[f43,f30])).
% 0.11/0.27  tff(f70,plain,(
% 0.11/0.27    ( ! [X0 : $int] : (~pow2(X0) | $less($product(X0,2),2) | pow2($product(X0,2))) )),
% 0.11/0.27    inference(superposition,[],[f31,f15])).
% 0.11/0.27  tff(f130,definition,(
% 0.11/0.27    spl1_4 <=> pow2(4)),
% 0.11/0.27    introduced(definition,[new_symbols(definition,[spl1_4])],[avatar_definition])).
% 0.11/0.27  tff(f132,plain,(
% 0.11/0.27    pow2(4) | ~spl1_4),
% 0.11/0.27    inference(avatar_component_clause,[],[f130])).
% 0.11/0.27  tff(f227,plain,(
% 0.11/0.27    $less($product(2,2),2) | pow2($product(2,2))),
% 0.11/0.27    inference(resolution,[],[f70,f44])).
% 0.11/0.27  tff(f230,plain,(
% 0.11/0.27    pow2(4)),
% 0.11/0.27    inference(evaluation,[],[f227])).
% 0.11/0.27  tff(f238,plain,(
% 0.11/0.27    spl1_4),
% 0.11/0.27    inference(avatar_split_clause,[],[f230,f130])).
% 0.11/0.27  tff(f239,plain,(
% 0.11/0.27    $less($product(4,2),2) | pow2($product(4,2)) | ~spl1_4),
% 0.11/0.27    inference(resolution,[],[f132,f70])).
% 0.11/0.27  tff(f246,plain,(
% 0.11/0.27    pow2(8) | ~spl1_4),
% 0.11/0.27    inference(evaluation,[],[f239])).
% 0.11/0.27  tff(f256,plain,(
% 0.11/0.27    $false | ~spl1_4),
% 0.11/0.27    inference(forward_subsumption_resolution,[],[f246,f28])).
% 0.11/0.27  tff(f257,plain,(
% 0.11/0.27    ~spl1_4),
% 0.11/0.27    inference(avatar_contradiction_clause,[],[f256])).
% 0.11/0.27  cnf(s8, plain, spl1_4, inference(sat_conversion,[],[f238])).
% 0.11/0.27  cnf(s10, plain, ~spl1_4, inference(sat_conversion,[],[f257])).
% 0.11/0.27  cnf(s11, plain, $false, inference(rat,[],[s8,s10])).
% 0.11/0.27  tff(f258,plain,(
% 0.11/0.27    $false),
% 0.11/0.27    inference(avatar_sat_refutation,[],[s11])).
% 0.11/0.27  % SZS output end Proof for theBenchmark
% 0.11/0.27  % (1161207)------------------------------
% 0.11/0.27  % (1161207)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.27  % (1161207)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.27  % (1161207)CaDiCaL version: 2.1.3
% 0.11/0.27  % (1161207)Termination reason: Refutation
% 0.11/0.27  % (1161207)Time elapsed: 0.009 s
% 0.11/0.27  % (1161207)Peak memory usage: 13 MB
% 0.11/0.27  % (1161207)Instructions burned: 10 (million)
% 0.11/0.27  % (1161192)Success in time 0.061 s
% 0.11/0.27  % Vampire exiting
%------------------------------------------------------------------------------