↑ 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  : SYN148-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 : n010.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:53 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   39 (  18 unt;   4 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   78 (  34   ~;  40   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   5 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   23 (   0 sgn  23   !;   0   ?)

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

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

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

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

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

fof(f88,axiom,
    ! [X0,X1] :
      ( n1(X0,X1,X0)
      | ~ s0(b)
      | ~ l0(X0)
      | ~ p0(b,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_050) ).

fof(f92,axiom,
    ! [X2,X0,X1] :
      ( n1(X0,X1,X1)
      | ~ l0(X2)
      | ~ l1(X2,X0)
      | ~ n1(X0,X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SYN001-0.ax',rule_054) ).

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

fof(f371,plain,
    ~ s0(b),
    inference(consistent_polarity_flipping,[],[f5]) ).

fof(f375,plain,
    ! [X0] : ~ p0(b,X0),
    inference(consistent_polarity_flipping,[],[f14]) ).

fof(f379,plain,
    ~ l0(c),
    inference(consistent_polarity_flipping,[],[f24]) ).

fof(f422,plain,
    ! [X0,X1] :
      ( n1(X0,X1,X0)
      | s0(b)
      | l0(X0)
      | p0(b,X1) ),
    inference(consistent_polarity_flipping,[],[f88]) ).

fof(f426,plain,
    ! [X2,X0,X1] :
      ( ~ l1(X2,X0)
      | l0(X2)
      | n1(X0,X1,X1)
      | ~ n1(X0,X1,X0) ),
    inference(consistent_polarity_flipping,[],[f92]) ).

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

fof(f1201,plain,
    ( ~ l0(c)
    | spl0_134 ),
    inference(avatar_component_clause,[],[f1200]) ).

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

fof(f1719,definition,
    ( spl0_261
  <=> ! [X0,X1] :
        ( n1(X0,X1,X0)
        | p0(b,X1)
        | l0(X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_261])],[avatar_definition]) ).

fof(f1720,plain,
    ( ! [X0,X1] :
        ( n1(X0,X1,X0)
        | p0(b,X1)
        | l0(X0) )
    | ~ spl0_261 ),
    inference(avatar_component_clause,[],[f1719]) ).

fof(f1721,plain,
    ( spl0_201
    | spl0_261 ),
    inference(avatar_split_clause,[],[f422,f1719,f1470]) ).

fof(f1828,definition,
    ( spl0_287
  <=> l1(c,c) ),
    introduced(definition,[new_symbols(definition,[spl0_287])],[avatar_definition]) ).

fof(f1829,plain,
    ( l1(c,c)
    | ~ spl0_287 ),
    inference(avatar_component_clause,[],[f1828]) ).

fof(f1858,plain,
    ~ spl0_134,
    inference(avatar_split_clause,[],[f379,f1200]) ).

fof(f1867,plain,
    ~ spl0_201,
    inference(avatar_split_clause,[],[f371,f1470]) ).

fof(f2014,plain,
    l1(c,c),
    inference(resolution,[],[f40,f26]) ).

fof(f2023,plain,
    spl0_287,
    inference(avatar_split_clause,[],[f2014,f1828]) ).

fof(f2436,plain,
    ( ! [X0,X1] :
        ( n1(X0,X1,X0)
        | l0(X0) )
    | ~ spl0_261 ),
    inference(forward_subsumption_resolution,[],[f1720,f375]) ).

fof(f2784,plain,
    ( ! [X0] :
        ( l0(c)
        | n1(c,X0,X0)
        | ~ n1(c,X0,c) )
    | ~ spl0_287 ),
    inference(resolution,[],[f426,f1829]) ).

fof(f2785,plain,
    ( ! [X0] :
        ( l0(c)
        | n1(c,X0,X0) )
    | ~ spl0_261
    | ~ spl0_287 ),
    inference(forward_subsumption_resolution,[],[f2784,f2436]) ).

fof(f2791,plain,
    ( ! [X0] : n1(c,X0,X0)
    | spl0_134
    | ~ spl0_261
    | ~ spl0_287 ),
    inference(forward_subsumption_resolution,[],[f2785,f1201]) ).

fof(f2878,plain,
    ( $false
    | spl0_134
    | ~ spl0_261
    | ~ spl0_287 ),
    inference(backward_subsumption_resolution,[],[f369,f2791]) ).

fof(f2879,plain,
    ( spl0_134
    | ~ spl0_261
    | ~ spl0_287 ),
    inference(avatar_contradiction_clause,[],[f2878]) ).

cnf(s131,plain,
    ( spl0_201
    | spl0_261 ),
    inference(sat_conversion,[],[f1721]) ).

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

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

cnf(s232,plain,
    spl0_287,
    inference(sat_conversion,[],[f2023]) ).

cnf(s344,plain,
    ( spl0_134
    | ~ spl0_261
    | ~ spl0_287 ),
    inference(sat_conversion,[],[f2879]) ).

cnf(s354,plain,
    ~ spl0_261,
    inference(rat,[],[s344,s232,s158]) ).

cnf(s380,plain,
    $false,
    inference(rat,[],[s131,s354,s167]) ).

fof(f2880,plain,
    $false,
    inference(avatar_sat_refutation,[],[s380]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN148-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.08/0.17  % Computer : n010.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 15:37:18 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  Running first-order model finding
% 0.08/0.20  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.08/0.26  % (2014198)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (2014204)% WARNING: option uhcvi not known.
% 0.08/0.26  % (2014204)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3952201531:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (2014203)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1375425661_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % (2014206)dis+10_1_sil=32000:sp=arity:random_seed=3441385106:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (2014205)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=646846602:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (2014207)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3571623991:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (2014208)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3229962992:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26  % (2014209)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2266573543:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26  % (2014204) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2014198-2014204"...
% 0.08/0.26  % (2014204)...printing done.
% 0.08/0.26  % (2014204)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (2014204)------------------------------
% 0.08/0.26  % (2014204)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (2014204)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (2014204)CaDiCaL version: 2.1.3
% 0.08/0.26  % (2014204)Termination reason: Refutation
% 0.08/0.26  % (2014204)Time elapsed: 0.018 s
% 0.08/0.26  % (2014204)Peak memory usage: 14 MB
% 0.08/0.26  % (2014204)Instructions burned: 43 (million)
% 0.08/0.26  % (2014198)Success in time 0.051 s
% 0.40/0.26  % Vampire exiting
%------------------------------------------------------------------------------