↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN746-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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 02:18:12 PM UTC 2026

% Result   : Satisfiable 0.10s 0.25s
% Output   : Saturation 0.10s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(u60,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssPv2(X4)
    | ~ ssRr(X2,X3)
    | ssPv1(X2)
    | ~ ssPv4(X2) ) ).

cnf(u59,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ssPv3(X4)
    | ~ ssRr(X2,X3)
    | ~ ssPv2(X2)
    | ~ ssPv3(X2) ) ).

cnf(u46,negated_conjecture,
    ( ssPv2(X3)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv2(X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2) ) ).

cnf(u80,negated_conjecture,
    ( ssPv4(X2)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssPv2(X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X6) ) ).

cnf(u71,negated_conjecture,
    ( ssPv4(X5)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X4)
    | ~ ssPv3(X2) ) ).

cnf(u53,negated_conjecture,
    ( ssPv1(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X4)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X1)
    | ~ ssPv3(X3)
    | ~ ssPv1(X4) ) ).

cnf(u48,negated_conjecture,
    ( ssPv4(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ssPv1(X3)
    | ssPv1(X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X1) ) ).

cnf(u66,negated_conjecture,
    ( ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ssPv2(X4)
    | ~ ssPv1(X5)
    | ssPv2(X2) ) ).

cnf(u73,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ssPv3(X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ssPv3(X5)
    | ~ ssPv3(X2) ) ).

cnf(u63,negated_conjecture,
    ( ssPv2(X5)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv3(X1)
    | ssPv2(X4)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2) ) ).

cnf(u58,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ssPv1(X4)
    | ~ ssRr(X2,X3)
    | ~ ssPv1(X2)
    | ~ ssPv4(X2) ) ).

cnf(u81,negated_conjecture,
    ( ssPv3(X2)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ssPv1(X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ssPv2(X6) ) ).

cnf(u52,negated_conjecture,
    ( ssPv1(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X1)
    | ~ ssPv1(X4)
    | ssPv2(X2) ) ).

cnf(u70,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv2(X2)
    | ~ ssPv3(X4)
    | ~ ssPv1(X5) ) ).

cnf(u77,negated_conjecture,
    ( ssPv3(X2)
    | ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X4)
    | ~ ssPv1(X6) ) ).

cnf(u51,negated_conjecture,
    ( ssPv4(X2)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ssPv1(X3)
    | ~ ssPv2(X2)
    | ~ ssRr(X0,X1) ) ).

cnf(u62,negated_conjecture,
    ( ssPv4(X3)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X4)
    | ~ ssPv2(X4)
    | ~ ssPv3(X2) ) ).

cnf(u74,negated_conjecture,
    ( ssPv4(X5)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ssPv1(X2)
    | ~ ssPv3(X4) ) ).

cnf(u45,negated_conjecture,
    ( ssPv2(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv4(X1)
    | ~ ssPv1(X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2) ) ).

cnf(u72,negated_conjecture,
    ( ssPv1(X5)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X2)
    | ~ ssPv1(X4) ) ).

cnf(u55,negated_conjecture,
    ( ssPv2(X4)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssPv2(X2)
    | ~ ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X2) ) ).

cnf(u65,negated_conjecture,
    ( ssPv4(X5)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X1)
    | ssPv2(X4)
    | ~ ssPv3(X2) ) ).

cnf(u76,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ~ ssPv4(X4)
    | ~ ssPv1(X6)
    | ssPv2(X2) ) ).

cnf(u50,negated_conjecture,
    ( ssPv3(X3)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X2)
    | ~ ssPv1(X2) ) ).

cnf(u57,negated_conjecture,
    ( ssPv3(X2)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X4)
    | ssPv2(X2) ) ).

cnf(u44,negated_conjecture,
    ( ssPv2(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssPv1(X1)
    | ~ ssPv4(X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv3(X2) ) ).

cnf(u43,negated_conjecture,
    ( ssPv4(X2)
    | ~ ssRr(X2,X0)
    | ssPv1(X2)
    | ~ ssPv2(X2)
    | ~ ssRr(X0,X1)
    | ssPv2(X1) ) ).

cnf(u75,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssPv2(X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ssPv3(X2)
    | ~ ssPv1(X5) ) ).

cnf(u69,negated_conjecture,
    ( ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssPv2(X5)
    | ssPv2(X4)
    | ssPv2(X2) ) ).

cnf(u64,negated_conjecture,
    ( ssPv4(X2)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X1)
    | ~ ssPv3(X4)
    | ~ ssPv4(X5) ) ).

cnf(u54,negated_conjecture,
    ( ssPv3(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X4)
    | ~ ssPv4(X3)
    | ssPv2(X4)
    | ~ ssPv4(X2) ) ).

cnf(u61,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ssPv1(X2)
    | ~ ssPv2(X2)
    | ~ ssPv3(X4) ) ).

cnf(u79,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ssPv3(X2)
    | ~ ssPv4(X4)
    | ~ ssPv3(X6) ) ).

cnf(u68,negated_conjecture,
    ( ssPv4(X1)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ssPv3(X5)
    | ssPv2(X4)
    | ssPv2(X2) ) ).

cnf(u56,negated_conjecture,
    ( ssPv3(X2)
    | ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X4)
    | ~ ssPv4(X2) ) ).

cnf(u47,negated_conjecture,
    ( ssPv3(X3)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ssPv1(X2)
    | ssPv2(X1)
    | ~ ssPv4(X2) ) ).

cnf(u42,negated_conjecture,
    ( ssPv2(X1)
    | ~ ssRr(X2,X0)
    | ~ ssPv2(X2)
    | ~ ssRr(X0,X1)
    | ~ ssPv1(X2)
    | ~ ssPv3(X2) ) ).

cnf(u49,negated_conjecture,
    ( ssPv4(X3)
    | ssPv3(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X0,X1)
    | ~ ssPv2(X2)
    | ~ ssPv4(X2) ) ).

cnf(clause1,negated_conjecture,
    ssRr(X0,skf1(X0)) ).

cnf(u67,negated_conjecture,
    ( ssPv1(X5)
    | ssPv1(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X2,X5)
    | ~ ssRr(X0,X1)
    | ~ ssPv4(X4)
    | ~ ssPv3(X2) ) ).

cnf(u78,negated_conjecture,
    ( ssPv1(X4)
    | ~ ssPv2(X1)
    | ~ ssRr(X2,X0)
    | ~ ssRr(X3,X4)
    | ~ ssRr(X0,X1)
    | ~ ssRr(X2,X3)
    | ~ ssRr(X5,X6)
    | ~ ssRr(X2,X5)
    | ssPv2(X6)
    | ssPv2(X2) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN746-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.18  % Computer : n004.cluster.edu
% 0.10/0.18  % Model    : x86_64 x86_64
% 0.10/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.18  % Memory   : 8046.5625MB
% 0.10/0.18  % OS       : Linux 6.8.0-71-generic
% 0.10/0.18  % CPULimit : 300
% 0.10/0.18  % WCLimit  : 300
% 0.10/0.18  % DateTime : Mon Sep 28 16:51:22 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.21  Running first-order model finding
% 0.10/0.21  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.10/0.25  % (511976)Will run a generic schedule for satisfiability detection.
% 0.10/0.25  % (511983)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=885728187:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25  % (511981)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3768261016_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25  % (511985)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=188399893:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25  % (511984)dis+10_1_sil=32000:sp=arity:random_seed=3863438044:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25  % (511986)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1916526075:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25  % (511982)% WARNING: option uhcvi not known.
% 0.10/0.25  % (511987)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=693795304:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25  % (511987) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-511976-511987"...
% 0.10/0.25  % (511982)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3473884980:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.25  % (511987)...printing done.
% 0.10/0.25  % TRYING [1]
% 0.10/0.25  % Finite Model Found!
% 0.10/0.25  % SZS status Satisfiable for theBenchmark
% 0.10/0.25  % (511981) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-511976-511981"...
% 0.10/0.25  % SZS status Satisfiable for theBenchmark
% 0.10/0.25  % SZS output start Saturation.
% See solution above
% 0.10/0.25  % SZS output start Definitions and Model Updates.
% 0.10/0.25  globally flip the polarity of every occurrence of predicate "ssPv4"
% 0.10/0.25  globally flip the polarity of every occurrence of predicate "ssPv3"
% 0.10/0.25  globally flip the polarity of every occurrence of predicate "ssPv1"
% 0.10/0.25  % SZS output end Definitions and Model Updates.
% 0.10/0.25  % (511987)------------------------------
% 0.10/0.25  % (511987)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (511987)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (511987)CaDiCaL version: 2.1.3
% 0.10/0.25  % (511987)Termination reason: Satisfiable
% 0.10/0.25  % (511987)Time elapsed: 0.003 s
% 0.10/0.25  % (511987)Peak memory usage: 11 MB
% 0.10/0.25  % (511987)Instructions burned: 5 (million)
% 0.10/0.25  % (511976)Success in time 0.029 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------