↑ 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  : SYN111-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 : n014.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.09s 0.27s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   62 (  24 unt;   9 def)
%            Number of atoms       :  135 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  144 (  71   ~;  64   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   18 (  17 usr;  10 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    s0(d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_1) ).

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

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

fof(f24,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_24) ).

fof(f32,axiom,
    k0(b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_32) ).

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

fof(f59,axiom,
    ! [X0,X1] :
      ( m1(X0,X1,X0)
      | ~ l0(X0)
      | ~ k0(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_021) ).

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

fof(f165,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ m1(X2,X1,X0)
      | k2(X0,X1)
      | ~ k1(X3)
      | ~ k2(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_127) ).

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

fof(f369,negated_conjecture,
    ~ k2(c,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f617,definition,
    ( spl0_64
  <=> k2(c,b) ),
    introduced(definition,[new_symbols(definition,[spl0_64])],[avatar_definition]) ).

fof(f619,plain,
    ( ~ k2(c,b)
    | spl0_64 ),
    inference(avatar_component_clause,[],[f617]) ).

fof(f699,definition,
    ( spl0_84
  <=> ! [X3] : ~ s0(X3) ),
    introduced(definition,[new_symbols(definition,[spl0_84])],[avatar_definition]) ).

fof(f700,plain,
    ( ! [X3] : ~ s0(X3)
    | ~ spl0_84 ),
    inference(avatar_component_clause,[],[f699]) ).

fof(f876,definition,
    ( spl0_128
  <=> s0(d) ),
    introduced(definition,[new_symbols(definition,[spl0_128])],[avatar_definition]) ).

fof(f877,plain,
    ( s0(d)
    | ~ spl0_128 ),
    inference(avatar_component_clause,[],[f876]) ).

fof(f900,definition,
    ( spl0_134
  <=> l0(c) ),
    introduced(definition,[new_symbols(definition,[spl0_134])],[avatar_definition]) ).

fof(f901,plain,
    ( l0(c)
    | ~ spl0_134 ),
    inference(avatar_component_clause,[],[f900]) ).

fof(f1099,definition,
    ( spl0_184
  <=> k0(b) ),
    introduced(definition,[new_symbols(definition,[spl0_184])],[avatar_definition]) ).

fof(f1100,plain,
    ( k0(b)
    | ~ spl0_184 ),
    inference(avatar_component_clause,[],[f1099]) ).

fof(f1129,definition,
    ( spl0_191
  <=> k1(b) ),
    introduced(definition,[new_symbols(definition,[spl0_191])],[avatar_definition]) ).

fof(f1130,plain,
    ( k1(b)
    | ~ spl0_191 ),
    inference(avatar_component_clause,[],[f1129]) ).

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

fof(f1174,definition,
    ( spl0_202
  <=> ! [X0] :
        ( q1(X0,b,b)
        | ~ s0(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_202])],[avatar_definition]) ).

fof(f1175,plain,
    ( ! [X0] :
        ( q1(X0,b,b)
        | ~ s0(X0) )
    | ~ spl0_202 ),
    inference(avatar_component_clause,[],[f1174]) ).

fof(f1176,plain,
    ( ~ spl0_201
    | spl0_202 ),
    inference(avatar_split_clause,[],[f157,f1174,f1170]) ).

fof(f1555,plain,
    spl0_184,
    inference(avatar_split_clause,[],[f32,f1099]) ).

fof(f1558,plain,
    spl0_134,
    inference(avatar_split_clause,[],[f24,f900]) ).

fof(f1567,plain,
    spl0_201,
    inference(avatar_split_clause,[],[f5,f1170]) ).

fof(f1568,plain,
    spl0_128,
    inference(avatar_split_clause,[],[f1,f876]) ).

fof(f1569,plain,
    ~ spl0_64,
    inference(avatar_split_clause,[],[f369,f617]) ).

fof(f1570,plain,
    ( $false
    | ~ spl0_84
    | ~ spl0_128 ),
    inference(forward_subsumption_resolution,[],[f877,f700]) ).

fof(f1571,plain,
    ( ~ spl0_84
    | ~ spl0_128 ),
    inference(avatar_contradiction_clause,[],[f1570]) ).

fof(f1627,plain,
    k1(b),
    inference(resolution,[],[f39,f15]) ).

fof(f1648,plain,
    spl0_191,
    inference(avatar_split_clause,[],[f1627,f1129]) ).

fof(f1877,plain,
    ( ! [X0] :
        ( k2(b,b)
        | ~ s0(X0) )
    | ~ spl0_202 ),
    inference(resolution,[],[f167,f1175]) ).

fof(f1883,definition,
    ( spl0_294
  <=> k2(b,b) ),
    introduced(definition,[new_symbols(definition,[spl0_294])],[avatar_definition]) ).

fof(f1885,plain,
    ( k2(b,b)
    | ~ spl0_294 ),
    inference(avatar_component_clause,[],[f1883]) ).

fof(f1886,plain,
    ( spl0_84
    | spl0_294
    | ~ spl0_202 ),
    inference(avatar_split_clause,[],[f1877,f1174,f1883,f699]) ).

fof(f2960,plain,
    ! [X2,X0,X1] :
      ( ~ k2(X2,X1)
      | ~ k1(X2)
      | k2(X0,X1)
      | ~ l0(X0)
      | ~ k0(X1) ),
    inference(resolution,[],[f165,f59]) ).

fof(f4836,plain,
    ( ! [X0] :
        ( ~ k1(b)
        | k2(X0,b)
        | ~ l0(X0)
        | ~ k0(b) )
    | ~ spl0_294 ),
    inference(resolution,[],[f2960,f1885]) ).

fof(f4839,plain,
    ( ! [X0] :
        ( k2(X0,b)
        | ~ l0(X0)
        | ~ k0(b) )
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(forward_subsumption_resolution,[],[f4836,f1130]) ).

fof(f4842,plain,
    ( ! [X0] :
        ( k2(X0,b)
        | ~ l0(X0) )
    | ~ spl0_184
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(forward_subsumption_resolution,[],[f4839,f1100]) ).

fof(f5065,plain,
    ( ~ l0(c)
    | spl0_64
    | ~ spl0_184
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(resolution,[],[f4842,f619]) ).

fof(f5066,plain,
    ( $false
    | spl0_64
    | ~ spl0_134
    | ~ spl0_184
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(forward_subsumption_resolution,[],[f5065,f901]) ).

fof(f5067,plain,
    ( spl0_64
    | ~ spl0_134
    | ~ spl0_184
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(avatar_contradiction_clause,[],[f5066]) ).

cnf(s94,plain,
    ( ~ spl0_201
    | spl0_202 ),
    inference(sat_conversion,[],[f1176]) ).

cnf(s155,plain,
    spl0_184,
    inference(sat_conversion,[],[f1555]) ).

cnf(s158,plain,
    spl0_134,
    inference(sat_conversion,[],[f1558]) ).

cnf(s167,plain,
    spl0_201,
    inference(sat_conversion,[],[f1567]) ).

cnf(s168,plain,
    spl0_128,
    inference(sat_conversion,[],[f1568]) ).

cnf(s169,plain,
    ~ spl0_64,
    inference(sat_conversion,[],[f1569]) ).

cnf(s170,plain,
    ( ~ spl0_84
    | ~ spl0_128 ),
    inference(sat_conversion,[],[f1571]) ).

cnf(s204,plain,
    spl0_191,
    inference(sat_conversion,[],[f1648]) ).

cnf(s274,plain,
    ( spl0_84
    | ~ spl0_202
    | spl0_294 ),
    inference(sat_conversion,[],[f1886]) ).

cnf(s553,plain,
    ( spl0_64
    | ~ spl0_134
    | ~ spl0_184
    | ~ spl0_191
    | ~ spl0_294 ),
    inference(sat_conversion,[],[f5067]) ).

cnf(s575,plain,
    ~ spl0_84,
    inference(rat,[],[s170,s168]) ).

cnf(s592,plain,
    ~ spl0_294,
    inference(rat,[],[s553,s158,s204,s169,s155]) ).

cnf(s594,plain,
    ~ spl0_202,
    inference(rat,[],[s274,s575,s592]) ).

cnf(s666,plain,
    $false,
    inference(rat,[],[s94,s594,s167]) ).

fof(f5075,plain,
    $false,
    inference(avatar_sat_refutation,[],[s666]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN111-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.16  % Computer : n014.cluster.edu
% 0.09/0.16  % Model    : x86_64 x86_64
% 0.09/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.16  % Memory   : 8046.5625MB
% 0.09/0.16  % OS       : Linux 6.8.0-71-generic
% 0.09/0.16  % CPULimit : 300
% 0.09/0.16  % WCLimit  : 300
% 0.09/0.16  % DateTime : Mon Sep 28 15:34:16 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19  Running first-order model finding
% 0.09/0.19  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.09/0.27  % (1856160)Will run a generic schedule for satisfiability detection.
% 0.09/0.27  % (1856168)dis+10_1_sil=32000:sp=arity:random_seed=248210608:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.09/0.27  % (1856166)% WARNING: option uhcvi not known.
% 0.09/0.27  % (1856165)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1622986098_2999 on theBenchmark for (2999ds/0Mi)
% 0.09/0.27  % (1856167)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2952459555:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.09/0.27  % (1856169)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2601209439:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.09/0.27  % (1856170)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2475596862:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.09/0.27  % (1856171)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=91375077:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.09/0.27  % (1856166)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2429562065:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.09/0.27  % Detected minimum model sizes of [1]
% 0.09/0.27  % Detected maximum model sizes of [5]
% 0.09/0.27  % TRYING [1]
% 0.09/0.27  % (1856168) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1856160-1856168"...
% 0.09/0.27  % TRYING [2]
% 0.09/0.27  % (1856168)...printing done.
% 0.09/0.27  % (1856168)Refutation found. Thanks to Tanya!
% 0.09/0.27  % SZS status Unsatisfiable for theBenchmark
% 0.09/0.27  % SZS output start Proof for theBenchmark
% See solution above
% 0.09/0.27  % (1856168)------------------------------
% 0.09/0.27  % (1856168)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.09/0.27  % (1856168)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.09/0.27  % (1856168)CaDiCaL version: 2.1.3
% 0.09/0.27  % (1856168)Termination reason: Refutation
% 0.09/0.27  % (1856168)Time elapsed: 0.030 s
% 0.09/0.27  % (1856168)Peak memory usage: 14 MB
% 0.09/0.27  % (1856168)Instructions burned: 86 (million)
% 0.09/0.27  % (1856160)Success in time 0.062 s
% 0.09/0.27  % Vampire exiting
%------------------------------------------------------------------------------