↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SYN108-1 : TPTP v9.3.1. Released v1.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:06:47 PM UTC 2026

% Result   : Unsatisfiable 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   28 (  11 unt;   3 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   45 (  23   ~;  19   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   4 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    s0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_5) ).

fof(f37,axiom,
    n0(b,a),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_37) ).

fof(f39,axiom,
    ! [X0,X1] :
      ( k1(X0)
      | ~ n0(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_001) ).

fof(f150,axiom,
    ! [X0] :
      ( q1(X0,X0,X0)
      | ~ k1(X0)
      | ~ s0(b) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_112) ).

fof(f167,axiom,
    ! [X0,X1] :
      ( k2(X0,X0)
      | ~ q1(X1,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_129) ).

fof(f369,negated_conjecture,
    ! [X0] : ~ k2(a,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f1014,definition,
    ( spl0_163
  <=> s0(b) ),
    introduced(definition,[new_symbols(definition,[spl0_163])],[avatar_definition]) ).

fof(f1042,definition,
    ( spl0_170
  <=> ! [X0] :
        ( q1(X0,X0,X0)
        | ~ k1(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_170])],[avatar_definition]) ).

fof(f1043,plain,
    ( ! [X0] :
        ( ~ k1(X0)
        | q1(X0,X0,X0) )
    | ~ spl0_170 ),
    inference(avatar_component_clause,[],[f1042]) ).

fof(f1044,plain,
    ( ~ spl0_163
    | spl0_170 ),
    inference(avatar_split_clause,[],[f150,f1042,f1014]) ).

fof(f1187,definition,
    ( spl0_206
  <=> k1(a) ),
    introduced(definition,[new_symbols(definition,[spl0_206])],[avatar_definition]) ).

fof(f1188,plain,
    ( k1(a)
    | ~ spl0_206 ),
    inference(avatar_component_clause,[],[f1187]) ).

fof(f1189,plain,
    ( ~ k1(a)
    | spl0_206 ),
    inference(avatar_component_clause,[],[f1187]) ).

fof(f1271,plain,
    spl0_163,
    inference(avatar_split_clause,[],[f5,f1014]) ).

fof(f1344,plain,
    ( ! [X0] : ~ n0(X0,a)
    | spl0_206 ),
    inference(resolution,[],[f1189,f39]) ).

fof(f1357,plain,
    ( $false
    | spl0_206 ),
    inference(resolution,[],[f1344,f37]) ).

fof(f1358,plain,
    spl0_206,
    inference(avatar_contradiction_clause,[],[f1357]) ).

fof(f1477,plain,
    ( q1(a,a,a)
    | ~ spl0_170
    | ~ spl0_206 ),
    inference(resolution,[],[f1043,f1188]) ).

fof(f1548,plain,
    ! [X0] : ~ q1(X0,a,a),
    inference(resolution,[],[f167,f369]) ).

fof(f1549,plain,
    ( $false
    | ~ spl0_170
    | ~ spl0_206 ),
    inference(resolution,[],[f1548,f1477]) ).

fof(f1550,plain,
    ( ~ spl0_170
    | ~ spl0_206 ),
    inference(avatar_contradiction_clause,[],[f1549]) ).

cnf(s82,plain,
    ( ~ spl0_163
    | spl0_170 ),
    inference(sat_conversion,[],[f1044]) ).

cnf(s130,plain,
    spl0_163,
    inference(sat_conversion,[],[f1271]) ).

cnf(s167,plain,
    spl0_206,
    inference(sat_conversion,[],[f1358]) ).

cnf(s202,plain,
    ( ~ spl0_170
    | ~ spl0_206 ),
    inference(sat_conversion,[],[f1550]) ).

cnf(s203,plain,
    ~ spl0_170,
    inference(rat,[],[s202,s167]) ).

cnf(s248,plain,
    $false,
    inference(rat,[],[s82,s203,s130]) ).

fof(f1551,plain,
    $false,
    inference(avatar_sat_refutation,[],[s248]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN108-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  % Computer : n019.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 15:34:18 UTC 2026
% 0.09/0.20  % CPUTime  : 
% 0.09/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23  Running first-order model finding
% 0.09/0.23  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.20/0.28  % (4094147)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (4094156)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4031277836:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28  % (4094153)% WARNING: option uhcvi not known.
% 0.20/0.28  % (4094152)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4227346457_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28  % (4094154)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1131984936:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28  % (4094155)dis+10_1_sil=32000:sp=arity:random_seed=3391981486:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28  % (4094153)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3473151631:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28  % (4094157)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2744738410:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28  % (4094158)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2466534776:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28  % (4094156) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4094147-4094156"...
% 0.20/0.28  % (4094156)...printing done.
% 0.20/0.28  % (4094156)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (4094156)------------------------------
% 0.20/0.28  % (4094156)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (4094156)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (4094156)CaDiCaL version: 2.1.3
% 0.20/0.28  % (4094156)Termination reason: Refutation
% 0.20/0.28  % (4094156)Time elapsed: 0.012 s
% 0.20/0.28  % (4094156)Peak memory usage: 13 MB
% 0.20/0.28  % (4094156)Instructions burned: 36 (million)
% 0.20/0.28  % (4094147)Success in time 0.041 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------