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

% Computer : n012.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:17:29 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u161,negated_conjecture,
    ndr1_0 ).

cnf(u165,negated_conjecture,
    ( ~ c3_1(X0)
    | c5_1(X0)
    | c3_2(X0,X1)
    | ~ c1_2(X0,X1)
    | ndr1_1(X0) ) ).

cnf(u168,negated_conjecture,
    ~ ssSkC1 ).

cnf(u177,negated_conjecture,
    ssSkC4 ).

cnf(u181,negated_conjecture,
    ( ~ c2_2(X0,X1)
    | c5_2(X0,X1)
    | c3_2(X0,X1)
    | c1_1(X0)
    | c1_2(X0,a405)
    | ndr1_1(X0) ) ).

cnf(u185,negated_conjecture,
    ( ~ c2_2(X0,X1)
    | c5_2(X0,X1)
    | c3_2(X0,X1)
    | c1_1(X0)
    | c2_2(X0,a405)
    | ndr1_1(X0) ) ).

cnf(u189,negated_conjecture,
    ( ~ c5_2(X0,a405)
    | c5_2(X0,X1)
    | ~ c2_2(X0,X1)
    | c1_1(X0)
    | c3_2(X0,X1)
    | ndr1_1(X0) ) ).

cnf(u197,negated_conjecture,
    ( ~ c4_2(X0,X1)
    | c5_1(X0)
    | ~ c1_2(X0,X2)
    | ~ c2_2(X0,X2)
    | ~ c2_2(X0,X1)
    | ndr1_1(X0) ) ).

cnf(u241,negated_conjecture,
    c3_0 ).

cnf(u246,negated_conjecture,
    c5_0 ).

cnf(u250,negated_conjecture,
    ndr1_1(a399) ).

cnf(u257,negated_conjecture,
    c2_0 ).

cnf(u261,negated_conjecture,
    ( ~ c1_1(X0)
    | ndr1_1(X0)
    | c4_2(X0,X1)
    | ~ c2_2(X0,X1)
    | ~ c3_2(X0,X1) ) ).

cnf(u265,negated_conjecture,
    c1_0 ).

cnf(u269,negated_conjecture,
    ( ~ c2_2(X0,X1)
    | ~ c3_1(X0)
    | ndr1_1(X0)
    | ~ c3_2(X0,X1) ) ).

cnf(u274,negated_conjecture,
    ~ c4_2(a403,a404) ).

cnf(u282,negated_conjecture,
    ~ c3_2(a403,a404) ).

cnf(u298,negated_conjecture,
    ( c3_2(X0,a389)
    | ~ c5_1(X0)
    | c1_1(X0) ) ).

cnf(u301,negated_conjecture,
    ~ ssSkC0 ).

cnf(u307,negated_conjecture,
    ~ c2_1(a403) ).

cnf(u312,negated_conjecture,
    ~ c1_1(a403) ).

cnf(u317,negated_conjecture,
    ~ ndr1_1(a403) ).

cnf(u321,negated_conjecture,
    ( ~ c1_2(X0,a389)
    | c1_1(X0)
    | ~ c5_1(X0) ) ).

cnf(u337,negated_conjecture,
    ( ~ ndr1_1(X0)
    | c1_1(X0)
    | ~ c5_1(X0) ) ).

cnf(u354,negated_conjecture,
    ssSkC3 ).

cnf(u366,negated_conjecture,
    ~ c4_2(a396,a397) ).

cnf(u371,negated_conjecture,
    ~ c5_2(a396,a397) ).

cnf(u376,negated_conjecture,
    c3_1(a396) ).

cnf(u381,negated_conjecture,
    ~ c3_2(a396,a397) ).

cnf(u386,negated_conjecture,
    c1_2(a401,a402) ).

cnf(u391,negated_conjecture,
    c3_2(a393,a394) ).

cnf(u394,negated_conjecture,
    ~ ssSkC2 ).

cnf(u400,negated_conjecture,
    c2_2(a393,a394) ).

cnf(u405,negated_conjecture,
    c1_2(a393,a395) ).

cnf(u409,negated_conjecture,
    ndr1_1(a396) ).

cnf(u415,negated_conjecture,
    c2_1(a399) ).

cnf(u420,negated_conjecture,
    ~ c2_2(a401,a402) ).

cnf(u425,negated_conjecture,
    c5_2(a393,a394) ).

cnf(u430,negated_conjecture,
    ~ c2_2(a393,a395) ).

cnf(u436,negated_conjecture,
    ~ ndr1_1(a401) ).

cnf(u453,negated_conjecture,
    ~ c3_1(a393) ).

cnf(u458,negated_conjecture,
    ~ ndr1_1(a393) ).

cnf(u491,negated_conjecture,
    ~ c5_1(a399) ).

cnf(u504,negated_conjecture,
    ~ c5_1(a396) ).

cnf(u100,negated_conjecture,
    ( c5_2(X0,a387)
    | ~ ssSkP0(X0) ) ).

cnf(u101,negated_conjecture,
    ( ~ c2_2(X0,a387)
    | ~ ssSkP0(X0) ) ).

cnf(u91,negated_conjecture,
    ( ~ ssSkP0(X0)
    | ~ ndr1_1(X0) ) ).

cnf(u102,negated_conjecture,
    ( ~ c3_2(X0,a387)
    | ~ ssSkP0(X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN531-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Mon Sep 28 16:26:19 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.00/0.11  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.13  Running first-order model finding
% 0.09/0.13  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.09/0.16  % (3496787)Will run a generic schedule for satisfiability detection.
% 0.09/0.16  % (3496800)% WARNING: option uhcvi not known.
% 0.09/0.16  % (3496800)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4075960671:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.16  % (3496803)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=366831509:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.16  % (3496799)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4160315350_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.16  % (3496806)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2474765933:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.16  % (3496801)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1352840701:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.16  % (3496800) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3496787-3496800"...
% 0.09/0.16  % (3496802)dis+10_1_sil=32000:sp=arity:random_seed=2681125444:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.16  % Detected minimum model sizes of [1]
% 0.09/0.16  % Detected maximum model sizes of [22]
% 0.09/0.16  % TRYING [1]
% 0.09/0.16  % (3496803) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3496787-3496803"...
% 0.09/0.16  % Finite Model Found!
% 0.09/0.16  % SZS status Satisfiable for theBenchmark
% 0.09/0.16  % (3496799) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3496787-3496799"...
% 0.09/0.16  % (3496800)...printing done.
% 0.09/0.16  % (3496801) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3496787-3496801"...
% 0.09/0.16  % (3496806) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3496787-3496806"...
% 0.09/0.16  % (3496803)...printing done.
% 0.09/0.16  % (3496799)...printing done.
% 0.09/0.16  % SZS status Satisfiable for theBenchmark
% 0.09/0.16  % SZS output start Saturation.
% See solution above
% 0.09/0.16  % SZS output start Definitions and Model Updates.
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ssSkC4"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ssSkC0"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c1_2"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c4_1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c3_2"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c2_2"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c3_0"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ssSkP0"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ndr1_1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c1_1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c3_1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c2_1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c2_0"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ssSkC1"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "ssSkC2"
% 0.09/0.16  globally flip the polarity of every occurrence of predicate "c5_0"
% 0.09/0.16  for all inputs,
% 0.09/0.16      define c4_0 := $true
% 0.09/0.16  for all inputs,
% 0.09/0.16      define c4_1(X0) := $true
% 0.09/0.16  % SZS output end Definitions and Model Updates.
% 0.09/0.16  % (3496800)------------------------------
% 0.09/0.16  % (3496800)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.16  % (3496800)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.16  % (3496800)CaDiCaL version: 2.1.3
% 0.09/0.16  % (3496800)Termination reason: Satisfiable
% 0.09/0.16  % (3496800)Time elapsed: 0.002 s
% 0.09/0.16  % (3496800)Peak memory usage: 11 MB
% 0.09/0.16  % (3496800)Instructions burned: 4 (million)
% 0.09/0.16  % (3496787)Success in time 0.028 s
% 0.09/0.16  % Vampire exiting
%------------------------------------------------------------------------------