↑ 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  : SYN231-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:07:04 PM UTC 2026

% Result   : Unsatisfiable 0.26s 0.34s
% Output   : Refutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   63 (  19 unt;   9 def)
%            Number of atoms       :  120 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  118 (  61   ~;  48   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   18 (  17 usr;  10 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?)

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

fof(f14,axiom,
    ! [X0] : p0(b,X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_14) ).

fof(f34,axiom,
    n0(c,d),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_34) ).

fof(f36,axiom,
    q0(a,b),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',axiom_36) ).

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

fof(f163,axiom,
    ! [X0] :
      ( s1(X0)
      | ~ p0(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_125) ).

fof(f164,axiom,
    ! [X2,X0,X1] :
      ( s1(X0)
      | ~ q0(X0,X1)
      | ~ s1(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_126) ).

fof(f228,axiom,
    ( s2(d)
    | ~ s1(a)
    | ~ s0(d) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_190) ).

fof(f258,axiom,
    ! [X0,X1] :
      ( l3(X0,X0)
      | ~ s2(X1)
      | ~ l1(X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_220) ).

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

fof(f507,definition,
    ( spl0_36
  <=> n0(c,d) ),
    introduced(definition,[new_symbols(definition,[spl0_36])],[avatar_definition]) ).

fof(f508,plain,
    ( n0(c,d)
    | ~ spl0_36 ),
    inference(avatar_component_clause,[],[f507]) ).

fof(f543,definition,
    ( spl0_45
  <=> ! [X1] : ~ s1(X1) ),
    introduced(definition,[new_symbols(definition,[spl0_45])],[avatar_definition]) ).

fof(f544,plain,
    ( ! [X1] : ~ s1(X1)
    | ~ spl0_45 ),
    inference(avatar_component_clause,[],[f543]) ).

fof(f654,definition,
    ( spl0_72
  <=> ! [X1] : ~ s2(X1) ),
    introduced(definition,[new_symbols(definition,[spl0_72])],[avatar_definition]) ).

fof(f655,plain,
    ( ! [X1] : ~ s2(X1)
    | ~ spl0_72 ),
    inference(avatar_component_clause,[],[f654]) ).

fof(f657,definition,
    ( spl0_73
  <=> ! [X0] :
        ( l3(X0,X0)
        | ~ l1(X0,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_73])],[avatar_definition]) ).

fof(f658,plain,
    ( ! [X0] :
        ( l3(X0,X0)
        | ~ l1(X0,X0) )
    | ~ spl0_73 ),
    inference(avatar_component_clause,[],[f657]) ).

fof(f659,plain,
    ( spl0_72
    | spl0_73 ),
    inference(avatar_split_clause,[],[f258,f657,f654]) ).

fof(f771,definition,
    ( spl0_102
  <=> s2(d) ),
    introduced(definition,[new_symbols(definition,[spl0_102])],[avatar_definition]) ).

fof(f773,plain,
    ( s2(d)
    | ~ spl0_102 ),
    inference(avatar_component_clause,[],[f771]) ).

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

fof(f780,definition,
    ( spl0_104
  <=> s1(a) ),
    introduced(definition,[new_symbols(definition,[spl0_104])],[avatar_definition]) ).

fof(f782,plain,
    ( ~ s1(a)
    | spl0_104 ),
    inference(avatar_component_clause,[],[f780]) ).

fof(f783,plain,
    ( ~ spl0_103
    | ~ spl0_104
    | spl0_102 ),
    inference(avatar_split_clause,[],[f228,f771,f780,f776]) ).

fof(f986,definition,
    ( spl0_156
  <=> ! [X1] : ~ p0(X1,X1) ),
    introduced(definition,[new_symbols(definition,[spl0_156])],[avatar_definition]) ).

fof(f987,plain,
    ( ! [X1] : ~ p0(X1,X1)
    | ~ spl0_156 ),
    inference(avatar_component_clause,[],[f986]) ).

fof(f1002,definition,
    ( spl0_160
  <=> ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_160])],[avatar_definition]) ).

fof(f1003,plain,
    ( ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) )
    | ~ spl0_160 ),
    inference(avatar_component_clause,[],[f1002]) ).

fof(f1004,plain,
    ( spl0_45
    | spl0_160 ),
    inference(avatar_split_clause,[],[f164,f1002,f543]) ).

fof(f1265,plain,
    spl0_36,
    inference(avatar_split_clause,[],[f34,f507]) ).

fof(f1277,plain,
    spl0_103,
    inference(avatar_split_clause,[],[f1,f776]) ).

fof(f1310,plain,
    ( $false
    | ~ spl0_156 ),
    inference(resolution,[],[f987,f14]) ).

fof(f1311,plain,
    ~ spl0_156,
    inference(avatar_contradiction_clause,[],[f1310]) ).

fof(f1346,plain,
    ( ! [X0] : ~ p0(X0,X0)
    | ~ spl0_45 ),
    inference(resolution,[],[f163,f544]) ).

fof(f1347,plain,
    ( spl0_156
    | ~ spl0_45 ),
    inference(avatar_split_clause,[],[f1346,f543,f986]) ).

fof(f1371,plain,
    ( ! [X0] : ~ q0(a,X0)
    | spl0_104
    | ~ spl0_160 ),
    inference(resolution,[],[f1003,f782]) ).

fof(f1378,plain,
    ( $false
    | spl0_104
    | ~ spl0_160 ),
    inference(resolution,[],[f1371,f36]) ).

fof(f1381,plain,
    ( spl0_104
    | ~ spl0_160 ),
    inference(avatar_contradiction_clause,[],[f1378]) ).

fof(f1382,plain,
    ( $false
    | ~ spl0_72
    | ~ spl0_102 ),
    inference(forward_subsumption_resolution,[],[f773,f655]) ).

fof(f1383,plain,
    ( ~ spl0_72
    | ~ spl0_102 ),
    inference(avatar_contradiction_clause,[],[f1382]) ).

fof(f1396,plain,
    ( l1(d,d)
    | ~ spl0_36 ),
    inference(resolution,[],[f40,f508]) ).

fof(f1479,plain,
    ( ~ l1(d,d)
    | ~ spl0_73 ),
    inference(resolution,[],[f658,f369]) ).

fof(f1480,plain,
    ( $false
    | ~ spl0_36
    | ~ spl0_73 ),
    inference(forward_subsumption_resolution,[],[f1479,f1396]) ).

fof(f1481,plain,
    ( ~ spl0_36
    | ~ spl0_73 ),
    inference(avatar_contradiction_clause,[],[f1480]) ).

cnf(s32,plain,
    ( spl0_72
    | spl0_73 ),
    inference(sat_conversion,[],[f659]) ).

cnf(s47,plain,
    ( spl0_102
    | ~ spl0_103
    | ~ spl0_104 ),
    inference(sat_conversion,[],[f783]) ).

cnf(s75,plain,
    ( spl0_45
    | spl0_160 ),
    inference(sat_conversion,[],[f1004]) ).

cnf(s119,plain,
    spl0_36,
    inference(sat_conversion,[],[f1265]) ).

cnf(s131,plain,
    spl0_103,
    inference(sat_conversion,[],[f1277]) ).

cnf(s145,plain,
    ~ spl0_156,
    inference(sat_conversion,[],[f1311]) ).

cnf(s160,plain,
    ( ~ spl0_45
    | spl0_156 ),
    inference(sat_conversion,[],[f1347]) ).

cnf(s173,plain,
    ( spl0_104
    | ~ spl0_160 ),
    inference(sat_conversion,[],[f1381]) ).

cnf(s174,plain,
    ( ~ spl0_72
    | ~ spl0_102 ),
    inference(sat_conversion,[],[f1383]) ).

cnf(s201,plain,
    ( ~ spl0_36
    | ~ spl0_73 ),
    inference(sat_conversion,[],[f1481]) ).

cnf(s205,plain,
    ~ spl0_45,
    inference(rat,[],[s160,s145]) ).

cnf(s212,plain,
    ~ spl0_73,
    inference(rat,[],[s201,s119]) ).

cnf(s255,plain,
    spl0_160,
    inference(rat,[],[s75,s205]) ).

cnf(s256,plain,
    spl0_104,
    inference(rat,[],[s173,s255]) ).

cnf(s278,plain,
    spl0_102,
    inference(rat,[],[s47,s256,s131]) ).

cnf(s280,plain,
    ~ spl0_72,
    inference(rat,[],[s174,s278]) ).

cnf(s288,plain,
    $false,
    inference(rat,[],[s32,s212,s280]) ).

fof(f1482,plain,
    $false,
    inference(avatar_sat_refutation,[],[s288]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN231-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.13/0.24  % Computer : n019.cluster.edu
% 0.13/0.24  % Model    : x86_64 x86_64
% 0.13/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.24  % Memory   : 8046.5625MB
% 0.13/0.24  % OS       : Linux 6.8.0-71-generic
% 0.13/0.24  % CPULimit : 300
% 0.13/0.25  % WCLimit  : 300
% 0.13/0.25  % DateTime : Mon Sep 28 15:39:04 UTC 2026
% 0.13/0.25  % CPUTime  : 
% 0.13/0.25  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.26/0.29  Running first-order model finding
% 0.26/0.29  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.26/0.34  % (4103250)Will run a generic schedule for satisfiability detection.
% 0.26/0.34  % (4103259)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=818286455:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.26/0.34  % (4103256)% WARNING: option uhcvi not known.
% 0.26/0.34  % (4103255)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1632319421_2999 on theBenchmark for (2999ds/0Mi)
% 0.26/0.34  % (4103256)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2337242313:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.26/0.34  % (4103257)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3825571053:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.26/0.34  % (4103258)dis+10_1_sil=32000:sp=arity:random_seed=2364569781:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.26/0.34  % (4103259) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4103250-4103259"...
% 0.26/0.34  % (4103259)...printing done.
% 0.26/0.34  % (4103259)Refutation found. Thanks to Tanya!
% 0.26/0.34  % SZS status Unsatisfiable for theBenchmark
% 0.26/0.34  % SZS output start Proof for theBenchmark
% See solution above
% 0.26/0.34  % (4103259)------------------------------
% 0.26/0.34  % (4103259)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.26/0.34  % (4103259)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.26/0.34  % (4103259)CaDiCaL version: 2.1.3
% 0.26/0.34  % (4103259)Termination reason: Refutation
% 0.26/0.34  % (4103259)Time elapsed: 0.011 s
% 0.26/0.34  % (4103259)Peak memory usage: 13 MB
% 0.26/0.34  % (4103259)Instructions burned: 35 (million)
% 0.26/0.34  % (4103250)Success in time 0.032 s
% 0.26/0.34  % Vampire exiting
%------------------------------------------------------------------------------