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

% Computer : n015.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:59 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.50s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   74 (  25 unt;   6 def)
%            Number of atoms       :  136 (  26 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :  117 (  55   ~;  56   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   7 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   25 (   0 sgn  25   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : gt(plus(X0,n1),n0),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_2) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ gt(X0,n0)
      | gt(X0,minus(X0,n1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_3) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( minus(X0,X1) = X2
      | plus(X2,X1) != X0
      | def_10(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_5) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ def_10(X0,X1)
      | ~ gt(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_6) ).

fof(f9,axiom,
    ! [X0,X1] :
      ( ~ gt(X0,X1)
      | gt(plus(X0,n1),plus(X1,n1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_8) ).

fof(f18,axiom,
    ! [X0] :
      ( X0 = n0
      | gt(X0,n0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_15) ).

fof(f19,plain,
    ! [X0] :
      ( n0 = X0
      | gt(X0,n0) ),
    inference(reorient_equations,[],[f18]) ).

fof(f24,axiom,
    ! [X0] : plus(n0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_19) ).

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

fof(f45,axiom,
    ! [X0] :
      ( p_Reset(X0)
      | ~ p_Wr(X0)
      | p_Rd(X0)
      | ~ gt(fifo_length,int_level(X0))
      | int_level(plus(X0,n1)) = plus(int_level(X0),n1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_35) ).

fof(f113,negated_conjecture,
    plus(level(t_139),n1) = fifo_length,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).

fof(f114,plain,
    fifo_length = plus(level(t_139),n1),
    inference(reorient_equations,[],[f113]) ).

fof(f115,negated_conjecture,
    ~ p_Rd(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_2) ).

fof(f116,negated_conjecture,
    p_Wr(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_3) ).

fof(f117,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_4) ).

fof(f118,negated_conjecture,
    level(plus(t_139,n1)) != fifo_length,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).

fof(f119,plain,
    fifo_length != level(plus(t_139,n1)),
    inference(reorient_equations,[],[f118]) ).

fof(f120,plain,
    fifo_length = plus(int_level(t_139),n1),
    inference(definition_unfolding,[],[f114,f26]) ).

fof(f121,plain,
    fifo_length != int_level(plus(t_139,n1)),
    inference(definition_unfolding,[],[f119,f26]) ).

fof(f123,plain,
    ! [X2,X1] :
      ( def_10(X1,plus(X2,X1))
      | minus(plus(X2,X1),X1) = X2 ),
    inference(equality_resolution,[],[f5]) ).

fof(f125,plain,
    ! [X0] : ~ gt(plus(X0,n1),n0),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f126,plain,
    ! [X0] :
      ( ~ gt(X0,minus(X0,n1))
      | gt(X0,n0) ),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f127,plain,
    ! [X0,X1] :
      ( ~ def_10(X0,X1)
      | gt(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f128,plain,
    ! [X0,X1] :
      ( ~ gt(plus(X0,n1),plus(X1,n1))
      | gt(X0,X1) ),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f135,plain,
    ! [X0] :
      ( ~ gt(X0,n0)
      | n0 = X0 ),
    inference(consistent_polarity_flipping,[],[f19]) ).

fof(f144,plain,
    ! [X0] :
      ( ~ p_Rd(X0)
      | ~ p_Wr(X0)
      | p_Reset(X0)
      | gt(fifo_length,int_level(X0))
      | int_level(plus(X0,n1)) = plus(int_level(X0),n1) ),
    inference(consistent_polarity_flipping,[],[f45]) ).

fof(f197,plain,
    p_Rd(t_139),
    inference(consistent_polarity_flipping,[],[f115]) ).

fof(f200,plain,
    ~ gt(fifo_length,n0),
    inference(superposition,[],[f125,f120]) ).

fof(f238,definition,
    ( spl0_5
  <=> n0 = int_level(t_139) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f240,plain,
    ( n0 = int_level(t_139)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f238]) ).

fof(f249,plain,
    ! [X0] :
      ( ~ gt(fifo_length,plus(X0,n1))
      | gt(int_level(t_139),X0) ),
    inference(superposition,[],[f128,f120]) ).

fof(f260,plain,
    ( ~ gt(fifo_length,n1)
    | gt(int_level(t_139),n0) ),
    inference(superposition,[],[f249,f24]) ).

fof(f263,definition,
    ( spl0_7
  <=> gt(int_level(t_139),n0) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f265,plain,
    ( gt(int_level(t_139),n0)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f267,definition,
    ( spl0_8
  <=> gt(fifo_length,n1) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f270,plain,
    ( spl0_7
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f260,f267,f263]) ).

fof(f317,plain,
    ( def_10(n1,fifo_length)
    | minus(fifo_length,n1) = int_level(t_139) ),
    inference(superposition,[],[f123,f120]) ).

fof(f322,definition,
    ( spl0_17
  <=> minus(fifo_length,n1) = int_level(t_139) ),
    introduced(definition,[new_symbols(definition,[spl0_17])],[avatar_definition]) ).

fof(f324,plain,
    ( minus(fifo_length,n1) = int_level(t_139)
    | ~ spl0_17 ),
    inference(avatar_component_clause,[],[f322]) ).

fof(f326,definition,
    ( spl0_18
  <=> def_10(n1,fifo_length) ),
    introduced(definition,[new_symbols(definition,[spl0_18])],[avatar_definition]) ).

fof(f328,plain,
    ( def_10(n1,fifo_length)
    | ~ spl0_18 ),
    inference(avatar_component_clause,[],[f326]) ).

fof(f329,plain,
    ( spl0_17
    | spl0_18 ),
    inference(avatar_split_clause,[],[f317,f326,f322]) ).

fof(f346,plain,
    ( ~ gt(fifo_length,int_level(t_139))
    | gt(fifo_length,n0)
    | ~ spl0_17 ),
    inference(superposition,[],[f126,f324]) ).

fof(f347,plain,
    ( ~ gt(fifo_length,int_level(t_139))
    | ~ spl0_17 ),
    inference(forward_subsumption_resolution,[],[f346,f200]) ).

fof(f547,definition,
    ( spl0_37
  <=> gt(fifo_length,int_level(t_139)) ),
    introduced(definition,[new_symbols(definition,[spl0_37])],[avatar_definition]) ).

fof(f549,plain,
    ( gt(fifo_length,int_level(t_139))
    | ~ spl0_37 ),
    inference(avatar_component_clause,[],[f547]) ).

fof(f551,plain,
    ( gt(fifo_length,n1)
    | ~ spl0_18 ),
    inference(resolution,[],[f328,f127]) ).

fof(f554,plain,
    ( spl0_8
    | ~ spl0_18 ),
    inference(avatar_split_clause,[],[f551,f326,f267]) ).

fof(f568,plain,
    ( n0 = int_level(t_139)
    | ~ spl0_7 ),
    inference(resolution,[],[f265,f135]) ).

fof(f576,plain,
    ( spl0_5
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f568,f263,f238]) ).

fof(f579,plain,
    ( ~ spl0_37
    | ~ spl0_17 ),
    inference(avatar_split_clause,[],[f347,f322,f547]) ).

fof(f631,plain,
    ( ~ p_Wr(t_139)
    | p_Reset(t_139)
    | gt(fifo_length,int_level(t_139))
    | plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
    inference(resolution,[],[f144,f197]) ).

fof(f634,plain,
    ( p_Reset(t_139)
    | gt(fifo_length,int_level(t_139))
    | plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
    inference(forward_subsumption_resolution,[],[f631,f116]) ).

fof(f636,plain,
    ( gt(fifo_length,int_level(t_139))
    | plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
    inference(forward_subsumption_resolution,[],[f634,f117]) ).

fof(f650,plain,
    ( fifo_length = int_level(plus(t_139,n1))
    | gt(fifo_length,int_level(t_139)) ),
    inference(forward_demodulation,[],[f636,f120]) ).

fof(f651,plain,
    gt(fifo_length,int_level(t_139)),
    inference(forward_subsumption_resolution,[],[f650,f121]) ).

fof(f652,plain,
    spl0_37,
    inference(avatar_split_clause,[],[f651,f547]) ).

fof(f763,plain,
    ( gt(fifo_length,n0)
    | ~ spl0_5
    | ~ spl0_37 ),
    inference(superposition,[],[f549,f240]) ).

fof(f794,plain,
    ( $false
    | ~ spl0_5
    | ~ spl0_37 ),
    inference(forward_subsumption_resolution,[],[f763,f200]) ).

fof(f795,plain,
    ( ~ spl0_5
    | ~ spl0_37 ),
    inference(avatar_contradiction_clause,[],[f794]) ).

cnf(s4,plain,
    ( spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f270]) ).

cnf(s8,plain,
    ( spl0_17
    | spl0_18 ),
    inference(sat_conversion,[],[f329]) ).

cnf(s36,plain,
    ( spl0_8
    | ~ spl0_18 ),
    inference(sat_conversion,[],[f554]) ).

cnf(s39,plain,
    ( spl0_5
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f576]) ).

cnf(s42,plain,
    ( ~ spl0_17
    | ~ spl0_37 ),
    inference(sat_conversion,[],[f579]) ).

cnf(s59,plain,
    spl0_37,
    inference(sat_conversion,[],[f652]) ).

cnf(s71,plain,
    ( ~ spl0_5
    | ~ spl0_37 ),
    inference(sat_conversion,[],[f795]) ).

cnf(s73,plain,
    ~ spl0_5,
    inference(rat,[],[s71,s59]) ).

cnf(s76,plain,
    ~ spl0_17,
    inference(rat,[],[s42,s59]) ).

cnf(s77,plain,
    ~ spl0_7,
    inference(rat,[],[s39,s73]) ).

cnf(s78,plain,
    spl0_18,
    inference(rat,[],[s8,s76]) ).

cnf(s79,plain,
    spl0_8,
    inference(rat,[],[s36,s78]) ).

cnf(s80,plain,
    $false,
    inference(rat,[],[s4,s79,s77]) ).

fof(f802,plain,
    $false,
    inference(avatar_sat_refutation,[],[s80]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV022-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.40  % Computer : n015.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sun Sep 27 11:01:00 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.44  Running first-order model finding
% 0.12/0.44  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.18/0.50  % (1485636)Will run a generic schedule for satisfiability detection.
% 0.18/0.50  % (1485641)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2861634563_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.50  % (1485642)% WARNING: option uhcvi not known.
% 0.18/0.50  % TRYING [1]
% 0.18/0.50  % TRYING [2]
% 0.18/0.50  % (1485642)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1041039289:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.50  % TRYING [3]
% 0.18/0.50  % (1485646)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=149327949:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.50  % (1485643)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2121020959:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.50  % (1485644)dis+10_1_sil=32000:sp=arity:random_seed=1462967577:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.50  % (1485645)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2588103477:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.50  % (1485647)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4041065166:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.50  % TRYING [4]
% 0.18/0.50  % TRYING [5]
% 0.18/0.50  % (1485642) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1485636-1485642"...
% 0.18/0.50  % (1485642)...printing done.
% 0.18/0.50  % (1485642)Refutation found. Thanks to Tanya!
% 0.18/0.50  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50  % (1485642)------------------------------
% 0.18/0.50  % (1485642)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.50  % (1485642)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.50  % (1485642)CaDiCaL version: 2.1.3
% 0.18/0.50  % (1485642)Termination reason: Refutation
% 0.18/0.50  % (1485642)Time elapsed: 0.017 s
% 0.18/0.50  % (1485642)Peak memory usage: 13 MB
% 0.18/0.50  % (1485642)Instructions burned: 22 (million)
% 0.18/0.50  % (1485636)Success in time 0.056 s
% 0.18/0.50  % Vampire exiting
%------------------------------------------------------------------------------