↑ 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  : HWV009-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n018.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 10:58:54 AM UTC 2026

% Result   : Unsatisfiable 0.19s 0.48s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   34 (  12 unt;   3 def)
%            Number of atoms       :   62 (  10 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   54 (  26   ~;  25   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn   5   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] : level(X0) = int_level(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

fof(f33,axiom,
    ! [X0] :
      ( ~ p_Reset(X0)
      | int_level(plus(X0,n1)) = n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_26) ).

fof(f34,plain,
    ! [X0] :
      ( ~ p_Reset(X0)
      | n0 = int_level(plus(X0,n1)) ),
    inference(reorient_equations,[],[f33]) ).

fof(f39,axiom,
    ! [X0] :
      ( ~ p_Wr_error(plus(X0,n1))
      | ~ p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_29) ).

fof(f40,axiom,
    ! [X0] :
      ( ~ p_Rd_error(plus(X0,n1))
      | ~ p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_30) ).

fof(f113,negated_conjecture,
    p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

fof(f114,negated_conjecture,
    ( level(plus(t_139,n1)) != n0
    | p_Wr_error(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

fof(f115,plain,
    ( n0 != level(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    inference(reorient_equations,[],[f114]) ).

fof(f116,plain,
    ( n0 != int_level(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | p_Rd_error(plus(t_139,n1)) ),
    inference(definition_unfolding,[],[f115,f26]) ).

fof(f240,definition,
    ( spl0_16
  <=> p_Rd_error(plus(t_139,n1)) ),
    introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).

fof(f241,plain,
    ( ~ p_Rd_error(plus(t_139,n1))
    | spl0_16 ),
    inference(avatar_component_clause,[],[f240]) ).

fof(f242,plain,
    ( p_Rd_error(plus(t_139,n1))
    | ~ spl0_16 ),
    inference(avatar_component_clause,[],[f240]) ).

fof(f248,plain,
    ( ~ p_Reset(t_139)
    | ~ spl0_16 ),
    inference(resolution,[],[f242,f40]) ).

fof(f249,plain,
    ( $false
    | ~ spl0_16 ),
    inference(forward_subsumption_resolution,[],[f248,f113]) ).

fof(f250,plain,
    ~ spl0_16,
    inference(avatar_contradiction_clause,[],[f249]) ).

fof(f287,plain,
    ( n0 != int_level(plus(t_139,n1))
    | p_Wr_error(plus(t_139,n1))
    | spl0_16 ),
    inference(forward_subsumption_resolution,[],[f116,f241]) ).

fof(f289,definition,
    ( spl0_22
  <=> p_Wr_error(plus(t_139,n1)) ),
    introduced(definition,[new_symbols(definition,[spl0_22])],[avatar_definition]) ).

fof(f291,plain,
    ( p_Wr_error(plus(t_139,n1))
    | ~ spl0_22 ),
    inference(avatar_component_clause,[],[f289]) ).

fof(f293,definition,
    ( spl0_23
  <=> n0 = int_level(plus(t_139,n1)) ),
    introduced(definition,[new_symbols(definition,[spl0_23])],[avatar_definition]) ).

fof(f295,plain,
    ( n0 != int_level(plus(t_139,n1))
    | spl0_23 ),
    inference(avatar_component_clause,[],[f293]) ).

fof(f296,plain,
    ( spl0_22
    | ~ spl0_23
    | spl0_16 ),
    inference(avatar_split_clause,[],[f287,f240,f293,f289]) ).

fof(f297,plain,
    ( ~ p_Reset(t_139)
    | ~ spl0_22 ),
    inference(resolution,[],[f291,f39]) ).

fof(f298,plain,
    ( $false
    | ~ spl0_22 ),
    inference(forward_subsumption_resolution,[],[f297,f113]) ).

fof(f299,plain,
    ~ spl0_22,
    inference(avatar_contradiction_clause,[],[f298]) ).

fof(f317,plain,
    n0 = int_level(plus(t_139,n1)),
    inference(resolution,[],[f34,f113]) ).

fof(f318,plain,
    ( $false
    | spl0_23 ),
    inference(forward_subsumption_resolution,[],[f317,f295]) ).

fof(f319,plain,
    spl0_23,
    inference(avatar_contradiction_clause,[],[f318]) ).

cnf(s203,plain,
    ~ spl0_16,
    inference(sat_conversion,[],[f250]) ).

cnf(s240,plain,
    ( spl0_16
    | spl0_22
    | ~ spl0_23 ),
    inference(sat_conversion,[],[f296]) ).

cnf(s243,plain,
    ~ spl0_22,
    inference(sat_conversion,[],[f299]) ).

cnf(s256,plain,
    spl0_23,
    inference(sat_conversion,[],[f319]) ).

cnf(s257,plain,
    spl0_16,
    inference(rat,[],[s240,s256,s243]) ).

cnf(s258,plain,
    $false,
    inference(rat,[],[s203,s257]) ).

fof(f320,plain,
    $false,
    inference(avatar_sat_refutation,[],[s258]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV009-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40  % Computer : n018.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 10:54:54 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.43  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.19/0.48  % (2160512)Will run a generic schedule for satisfiability detection.
% 0.19/0.48  % (2160519)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=563776663:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.48  % (2160518)% WARNING: option uhcvi not known.
% 0.19/0.48  % (2160519) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2160512-2160519"...
% 0.19/0.48  % (2160519)...printing done.
% 0.19/0.48  % (2160519)Refutation found. Thanks to Tanya!
% 0.19/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (2160519)------------------------------
% 0.19/0.48  % (2160519)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48  % (2160519)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48  % (2160519)CaDiCaL version: 2.1.3
% 0.19/0.48  % (2160519)Termination reason: Refutation
% 0.19/0.48  % (2160519)Time elapsed: 0.004 s
% 0.19/0.48  % (2160519)Peak memory usage: 12 MB
% 0.19/0.48  % (2160519)Instructions burned: 9 (million)
% 0.19/0.48  % (2160512)Success in time 0.032 s
% 0.19/0.48  % Vampire exiting
%------------------------------------------------------------------------------