↑ Up

Vampire-SAT---5.0.1.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM449+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n004.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 12:24:21 PM UTC 2026

% Result   : CounterSatisfiable 0.23s 0.53s
% Output   : Saturation 0.23s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u297,axiom,
    ~ aDivisorOf0(sz00,X0) ).

cnf(u309,axiom,
    ~ aSubsetOf0(X0,cS1395) ).

cnf(u316,axiom,
    ~ aDivisorOf0(X2,sz10) ).

cnf(u319,axiom,
    ~ isPrime0(X2) ).

cnf(u322,axiom,
    aInteger0(smndt0(X0)) ).

cnf(u328,axiom,
    ~ sP4(X0,X1) ).

cnf(u332,axiom,
    sdtpldt0(sz00,X0) = X0 ).

cnf(u339,axiom,
    sdtpldt0(X0,sz00) = X0 ).

cnf(u346,axiom,
    sdtasdt0(sz10,X0) = X0 ).

cnf(u353,axiom,
    sdtasdt0(X0,sz10) = X0 ).

cnf(u360,axiom,
    sz00 = sdtasdt0(sz00,X0) ).

cnf(u367,axiom,
    sz00 = sdtasdt0(X0,sz00) ).

cnf(u374,axiom,
    aInteger0(X1) ).

cnf(u377,axiom,
    ~ aDivisorOf0(X1,X0) ).

cnf(u413,axiom,
    isOpen0(sbsmnsldt0(X0)) ).

cnf(u416,axiom,
    aElementOf0(sK19(X0),X0) ).

cnf(u424,axiom,
    ~ sP1(X0,X1) ).

cnf(u430,axiom,
    ~ sP3(X0,X1) ).

cnf(u433,axiom,
    aElementOf0(X4,X2) ).

cnf(u436,axiom,
    ~ sP2(X0,X1,X2) ).

cnf(u487,axiom,
    sdteqdtlpzmzozddtrp0(X0,X0,X1) ).

cnf(u490,axiom,
    sz00 = X1 ).

cnf(u680,axiom,
    ~ aSet0(X0) ).

cnf(u183,axiom,
    ( ~ aInteger0(X0)
    | sz00 = sdtasdt0(X0,sz00) ) ).

cnf(u285,axiom,
    ( sP2(sdtslmnbsdt0(X1,X0),X1,X0)
    | ~ sP3(X0,X1) ) ).

cnf(u385,axiom,
    sz00 = smndt0(sz00) ).

cnf(u552,negated_conjecture,
    ~ isClosed0(X0) ).

cnf(u221,axiom,
    ( ~ sP2(X0,X1,X2)
    | ~ aElementOf0(X4,X0)
    | aElementOf0(X4,X2) ) ).

cnf(u279,negated_conjecture,
    ~ isClosed0(sbsmnsldt0(cS2043)) ).

cnf(u329,axiom,
    ~ sP5(X0) ).

cnf(u173,axiom,
    ( ~ aInteger0(X0)
    | sdtpldt0(X0,sz00) = X0 ) ).

cnf(u165,axiom,
    aInteger0(sz00) ).

cnf(u281,axiom,
    ( ~ aDivisorOf0(sz00,X0)
    | ~ aInteger0(X0) ) ).

cnf(u167,axiom,
    ( aInteger0(smndt0(X0))
    | ~ aInteger0(X0) ) ).

cnf(u553,axiom,
    ~ aSubsetOf0(X1,X0) ).

cnf(u458,axiom,
    sdtasdt0(X0,X1) = sdtasdt0(X1,X0) ).

cnf(u277,hypothesis,
    cS2076 = stldt0(sbsmnsldt0(cS2043)) ).

cnf(u528,negated_conjecture,
    ~ isClosed0(sz00) ).

cnf(u284,axiom,
    ( sP0(sdtbsmnsldt0(X1,X0),X1,X0)
    | ~ sP1(X0,X1) ) ).

cnf(u404,axiom,
    smndt0(X0) = sdtasdt0(X0,smndt0(sz10)) ).

cnf(u178,axiom,
    ( ~ aInteger0(X0)
    | sdtasdt0(sz10,X0) = X0 ) ).

cnf(u491,axiom,
    X0 = X1 ).

cnf(u190,axiom,
    ( ~ aDivisorOf0(X1,X0)
    | aInteger0(X1)
    | ~ aInteger0(X0) ) ).

cnf(u182,axiom,
    ( ~ aInteger0(X0)
    | sz00 = sdtasdt0(sz00,X0) ) ).

cnf(u444,axiom,
    sdtpldt0(X0,X1) = sdtpldt0(X1,X0) ).

cnf(u384,axiom,
    sz00 = sdtpldt0(smndt0(X0),X0) ).

cnf(u554,hypothesis,
    isFinite0(X0) ).

cnf(u555,axiom,
    isOpen0(X0) ).

cnf(u390,axiom,
    sz00 = sdtpldt0(X0,smndt0(X0)) ).

cnf(u172,axiom,
    ( ~ aInteger0(X0)
    | sdtpldt0(sz00,X0) = X0 ) ).

cnf(u290,axiom,
    ( ~ aElementOf0(X3,stldt0(X0))
    | ~ aElementOf0(X3,X0)
    | ~ aSubsetOf0(X0,cS1395) ) ).

cnf(u166,axiom,
    aInteger0(sz10) ).

cnf(u529,axiom,
    isOpen0(sz00) ).

cnf(u313,axiom,
    ( ~ aDivisorOf0(X2,sz10)
    | ~ isPrime0(X2) ) ).

cnf(u684,axiom,
    ~ sP0(X0,X1,X2) ).

cnf(u407,axiom,
    smndt0(X0) = sdtasdt0(smndt0(sz10),X0) ).

cnf(u533,hypothesis,
    isFinite0(sz00) ).

cnf(u278,hypothesis,
    isFinite0(cS2043) ).

cnf(u237,axiom,
    ( ~ sP4(X0,X1)
    | aSet0(X0) ) ).

cnf(u179,axiom,
    ( ~ aInteger0(X0)
    | sdtasdt0(X0,sz10) = X0 ) ).

cnf(u484,axiom,
    ( sdteqdtlpzmzozddtrp0(X0,X0,X1)
    | sz00 = X1 ) ).

cnf(u523,axiom,
    ~ aSubsetOf0(X0,sz00) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : NUM449+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.42  % Computer : n004.cluster.edu
% 0.18/0.42  % Model    : x86_64 x86_64
% 0.18/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.42  % Memory   : 8046.5625MB
% 0.18/0.42  % OS       : Linux 6.8.0-71-generic
% 0.18/0.42  % CPULimit : 300
% 0.18/0.42  % WCLimit  : 300
% 0.18/0.42  % DateTime : Sun Sep 27 19:58:21 UTC 2026
% 0.18/0.43  % CPUTime  : 
% 0.18/0.43  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.48  Running first-order model finding
% 0.23/0.48  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.23/0.53  % (3841220)Will run a generic schedule for satisfiability detection.
% 0.23/0.53  % (3841230)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1285039402:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.53  % (3841227)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4111994537:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.53  % (3841226)% WARNING: option uhcvi not known.
% 0.23/0.53  % (3841228)dis+10_1_sil=32000:sp=arity:random_seed=303570905:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.53  % (3841225)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1082310839_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.53  % (3841226)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2825622230:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.53  % (3841229)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1440557402:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.53  % (3841231)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4288253911:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.53  % (3841227) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3841220-3841227"...
% 0.23/0.53  % (3841227)...printing done.
% 0.23/0.53  % SZS status CounterSatisfiable for theBenchmark
% 0.23/0.53  % SZS output start Saturation.
% See solution above
% 0.23/0.53  % SZS output start Definitions and Model Updates.
% 0.23/0.53  for all inputs,
% 0.23/0.53      define xS := cS2043
% 0.23/0.53  % SZS output end Definitions and Model Updates.
% 0.23/0.53  % (3841227)------------------------------
% 0.23/0.53  % (3841227)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.53  % (3841227)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.53  % (3841227)CaDiCaL version: 2.1.3
% 0.23/0.53  % (3841227)Termination reason: Satisfiable
% 0.23/0.53  % (3841227)Time elapsed: 0.013 s
% 0.23/0.53  % (3841227)Peak memory usage: 12 MB
% 0.23/0.53  % (3841227)Instructions burned: 16 (million)
% 0.23/0.53  % (3841220)Success in time 0.04 s
% 0.23/0.53  % Vampire exiting
%------------------------------------------------------------------------------