↑ 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  : SYN522-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 : n016.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:27 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(u118,negated_conjecture,
    ~ ndr1_1(a110) ).

cnf(u121,negated_conjecture,
    ndr1_0 ).

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

cnf(u128,negated_conjecture,
    ssSkC2 ).

cnf(u134,negated_conjecture,
    ~ c3_1(a110) ).

cnf(u138,negated_conjecture,
    c4_1(a110) ).

cnf(u143,negated_conjecture,
    ~ c3_0 ).

cnf(u151,negated_conjecture,
    ( c3_2(X0,X1)
    | ~ ndr1_1(X0)
    | c2_2(X0,X1)
    | c1_2(X0,X1)
    | ~ c5_1(X0)
    | ~ c4_1(X0) ) ).

cnf(u155,negated_conjecture,
    c4_0 ).

cnf(u160,negated_conjecture,
    ~ c2_0 ).

cnf(u182,negated_conjecture,
    ~ ssSkC3 ).

cnf(u186,negated_conjecture,
    ( ~ c3_2(X0,a111)
    | c4_2(X0,X1)
    | c1_2(X0,X1)
    | ~ c4_1(X0)
    | ~ c2_2(X0,X1)
    | ~ ndr1_1(X0) ) ).

cnf(u199,negated_conjecture,
    ~ ssSkC0 ).

cnf(u203,negated_conjecture,
    ( ~ c3_2(X0,a105)
    | c3_2(X0,X1)
    | c2_2(X0,X1)
    | ~ ssSkP0(X0)
    | ~ ndr1_1(X0)
    | ~ c5_2(X0,X1) ) ).

cnf(u207,negated_conjecture,
    ( ~ c5_2(X0,X1)
    | c3_2(X0,X1)
    | c2_2(X0,X1)
    | ~ c4_2(X0,a105)
    | ~ ndr1_1(X0)
    | ~ ssSkP0(X0) ) ).

cnf(u211,negated_conjecture,
    ( ~ c2_2(X0,X1)
    | c2_2(X0,a111)
    | c4_2(X0,X1)
    | c1_2(X0,X1)
    | ~ c4_1(X0)
    | ~ ndr1_1(X0) ) ).

cnf(u215,negated_conjecture,
    ( ~ c2_2(X0,X1)
    | c5_2(X0,a111)
    | c4_2(X0,X1)
    | c1_2(X0,X1)
    | ~ c4_1(X0)
    | ~ ndr1_1(X0) ) ).

cnf(u219,negated_conjecture,
    ( ~ c5_2(X0,X1)
    | c2_2(X0,a105)
    | c3_2(X0,X1)
    | c2_2(X0,X1)
    | ~ ndr1_1(X0)
    | ~ ssSkP0(X0) ) ).

cnf(u223,negated_conjecture,
    ~ c5_0 ).

cnf(u228,negated_conjecture,
    ~ c1_0 ).

cnf(u231,negated_conjecture,
    ( c5_2(X0,X1)
    | ~ ndr1_1(X0)
    | c4_2(X0,X1)
    | ~ c4_1(X0)
    | ~ c3_1(X0) ) ).

cnf(u236,negated_conjecture,
    ~ ndr1_1(a130) ).

cnf(u242,negated_conjecture,
    ssSkC5 ).

cnf(u246,negated_conjecture,
    ssSkC4 ).

cnf(u258,negated_conjecture,
    ndr1_1(a121) ).

cnf(u266,negated_conjecture,
    ( ~ c1_2(a121,X0)
    | c3_2(a121,X0)
    | ~ c4_2(a121,X0) ) ).

cnf(u285,negated_conjecture,
    ssSkC1 ).

cnf(u298,negated_conjecture,
    ~ ndr1_1(a114) ).

cnf(u302,negated_conjecture,
    ( ~ c1_2(X0,a120)
    | c4_1(X0)
    | ~ ssSkP3(X0) ) ).

cnf(u314,negated_conjecture,
    ( c5_2(X0,a120)
    | c4_1(X0)
    | ~ ssSkP3(X0) ) ).

cnf(u318,negated_conjecture,
    ( c2_2(X0,a120)
    | c4_1(X0)
    | ~ ssSkP3(X0) ) ).

cnf(u330,negated_conjecture,
    ( ~ ssSkP3(X0)
    | c4_1(X0)
    | ndr1_1(X0) ) ).

cnf(u335,negated_conjecture,
    ssSkC6 ).

cnf(u370,negated_conjecture,
    ~ c2_2(a121,a122) ).

cnf(u422,negated_conjecture,
    c3_2(a121,a122) ).

cnf(u427,negated_conjecture,
    ~ c1_1(a130) ).

cnf(u432,negated_conjecture,
    ~ c2_1(a133) ).

cnf(u437,negated_conjecture,
    ~ c5_1(a133) ).

cnf(u498,negated_conjecture,
    ~ c1_1(a114) ).

cnf(u503,negated_conjecture,
    ~ c2_1(a118) ).

cnf(u535,negated_conjecture,
    c1_1(a118) ).

cnf(u540,negated_conjecture,
    c5_1(a118) ).

cnf(u585,negated_conjecture,
    ~ c4_2(a121,a116) ).

cnf(u593,negated_conjecture,
    ~ c1_2(a121,a122) ).

cnf(u601,negated_conjecture,
    ~ c5_1(a121) ).

cnf(clause34,negated_conjecture,
    ( c4_2(X0,a119)
    | ssSkP3(X0) ) ).

cnf(clause44,negated_conjecture,
    ( c4_2(X0,a104)
    | ssSkP0(X0) ) ).

cnf(u659,negated_conjecture,
    ( c1_2(X0,a105)
    | ssSkP2(X0)
    | ~ c3_1(X0)
    | ~ c5_1(X0)
    | c2_2(X0,a111)
    | c4_2(X0,a105)
    | ~ ssSkP0(X0)
    | ~ c4_1(X0) ) ).

cnf(clause66,negated_conjecture,
    ( ~ c1_2(X0,a104)
    | ssSkP0(X0) ) ).

cnf(clause36,negated_conjecture,
    ( c1_2(X0,a116)
    | ssSkP2(X0) ) ).

cnf(clause18,negated_conjecture,
    ( ssSkP3(X0)
    | ndr1_1(X0) ) ).

cnf(clause20,negated_conjecture,
    ( ssSkP1(X0)
    | ndr1_1(X0) ) ).

cnf(clause64,negated_conjecture,
    ( ~ c2_2(X0,a116)
    | ssSkP2(X0) ) ).

cnf(clause63,negated_conjecture,
    ( ~ c2_2(X0,a119)
    | ssSkP3(X0) ) ).

cnf(u650,negated_conjecture,
    ( c3_2(X0,X1)
    | c2_2(X0,a105)
    | c2_2(X0,X1)
    | ~ ndr1_1(X0)
    | ~ ssSkP0(X0)
    | c4_2(X0,X1)
    | ~ c4_1(X0)
    | ~ c3_1(X0) ) ).

cnf(u634,negated_conjecture,
    ( ~ c4_2(X0,a105)
    | c3_2(X0,a116)
    | ~ ssSkP0(X0)
    | ssSkP2(X0) ) ).

cnf(clause14,negated_conjecture,
    ( ssSkP4(X0)
    | ndr1_1(X0) ) ).

cnf(u643,negated_conjecture,
    ( c5_2(X0,a111)
    | c1_2(X0,a115)
    | ~ c4_1(X0)
    | ssSkP1(X0) ) ).

cnf(clause55,negated_conjecture,
    ( ~ c1_2(X0,a131)
    | ssSkP4(X0) ) ).

cnf(clause23,negated_conjecture,
    ( ssSkP0(X0)
    | ndr1_1(X0) ) ).

cnf(u638,negated_conjecture,
    ( c1_2(X0,a115)
    | c2_2(X0,a111)
    | ~ c4_1(X0)
    | ssSkP1(X0) ) ).

cnf(u652,negated_conjecture,
    ( c3_2(X0,a116)
    | c2_2(X0,a105)
    | ~ ssSkP0(X0)
    | ssSkP2(X0) ) ).

cnf(clause35,negated_conjecture,
    ( c5_2(X0,a116)
    | ssSkP2(X0) ) ).

cnf(u611,negated_conjecture,
    ( c1_2(X0,a119)
    | ~ c5_1(X0)
    | ~ c4_1(X0)
    | ssSkP3(X0) ) ).

cnf(clause45,negated_conjecture,
    ( c3_2(X0,a104)
    | ssSkP0(X0) ) ).

cnf(clause37,negated_conjecture,
    ( c2_2(X0,a115)
    | ssSkP1(X0) ) ).

cnf(u551,negated_conjecture,
    ( c4_1(X0)
    | ndr1_1(X0) ) ).

cnf(u632,negated_conjecture,
    ( ~ c4_2(X0,a105)
    | c2_2(X0,X1)
    | c3_2(X0,X1)
    | ~ ndr1_1(X0)
    | ~ ssSkP0(X0)
    | c4_2(X0,X1)
    | ~ c4_1(X0)
    | ~ c3_1(X0) ) ).

cnf(clause65,negated_conjecture,
    ( ~ c4_2(X0,a115)
    | ssSkP1(X0) ) ).

cnf(u668,negated_conjecture,
    ( ~ c1_2(X0,X1)
    | c2_2(X0,X1)
    | ~ ndr1_1(X0)
    | ~ ssSkP0(X0)
    | c4_2(X0,X1)
    | ~ c4_1(X0)
    | ~ c3_1(X0)
    | ~ c5_1(X0)
    | c2_2(X0,a105) ) ).

cnf(clause19,negated_conjecture,
    ( ssSkP2(X0)
    | ndr1_1(X0) ) ).

cnf(clause38,negated_conjecture,
    ( c5_2(X0,a115)
    | ssSkP1(X0) ) ).

cnf(u656,negated_conjecture,
    ( c2_2(X0,a105)
    | ~ ssSkP0(X0)
    | ssSkP2(X0)
    | ~ c3_1(X0)
    | ~ c5_1(X0) ) ).

cnf(clause62,negated_conjecture,
    ( ~ c3_2(X0,a119)
    | ssSkP3(X0) ) ).

cnf(u660,negated_conjecture,
    ( c5_2(X0,a111)
    | ssSkP2(X0)
    | ~ c3_1(X0)
    | ~ c5_1(X0)
    | ~ ssSkP0(X0)
    | c4_2(X0,a105)
    | c1_2(X0,a105)
    | ~ c4_1(X0) ) ).

cnf(clause54,negated_conjecture,
    ( ~ c4_2(X0,a131)
    | ssSkP4(X0) ) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN522-1 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n016.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.20  % CPULimit : 300
% 0.08/0.20  % WCLimit  : 300
% 0.08/0.20  % DateTime : Mon Sep 28 16:30:18 UTC 2026
% 0.08/0.20  % CPUTime  : 
% 0.08/0.20  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23  Running first-order model finding
% 0.08/0.23  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.20/0.28  % (3744305)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (3744313)dis+10_1_sil=32000:sp=arity:random_seed=1823444987:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28  % (3744311)% WARNING: option uhcvi not known.
% 0.20/0.28  % (3744313) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3744305-3744313"...
% 0.20/0.28  % (3744313)...printing done.
% 0.20/0.28  % SZS status Satisfiable for theBenchmark
% 0.20/0.28  % SZS output start Saturation.
% See solution above
% 0.20/0.28  % SZS output start Definitions and Model Updates.
% 0.20/0.28  for all inputs,
% 0.20/0.28      define ssSkC7 := $true
% 0.20/0.28  % SZS output end Definitions and Model Updates.
% 0.20/0.28  % (3744313)------------------------------
% 0.20/0.28  % (3744313)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (3744313)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (3744313)CaDiCaL version: 2.1.3
% 0.20/0.28  % (3744313)Termination reason: Satisfiable
% 0.20/0.28  % (3744313)Time elapsed: 0.003 s
% 0.20/0.28  % (3744313)Peak memory usage: 11 MB
% 0.20/0.28  % (3744313)Instructions burned: 7 (million)
% 0.20/0.28  % (3744305)Success in time 0.037 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------