↑ 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  : HWV017-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 : n005.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:57 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.49s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (  14 unt;   2 def)
%            Number of atoms       :  102 (  20 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   84 (  29   ~;  53   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   3 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?)

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

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

fof(f28,axiom,
    ! [X0] :
      ( ~ p_Full(X0)
      | int_level(X0) = fifo_length ),
    file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_23) ).

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

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

fof(f99,plain,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | gt(int_level(X0),n0)
      | int_level(X0) = int_level(plus(X0,n1)) ),
    inference(reorient_equations,[],[f98]) ).

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

fof(f104,plain,
    ! [X0] :
      ( p_Rd(X0)
      | p_Wr(X0)
      | p_Reset(X0)
      | int_level(X0) = int_level(plus(X0,n1)) ),
    inference(reorient_equations,[],[f103]) ).

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

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

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

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

fof(f117,negated_conjecture,
    p_Full(plus(t_139,n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).

fof(f118,negated_conjecture,
    gt(fifo_length,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_6) ).

fof(f119,plain,
    ~ gt(int_level(t_139),fifo_length),
    inference(definition_unfolding,[],[f113,f26]) ).

fof(f122,plain,
    ! [X0] :
      ( p_Wr(X0)
      | p_Reset(X0)
      | gt(int_level(X0),n0)
      | int_level(X0) = int_level(plus(X0,n1)) ),
    inference(forward_subsumption_resolution,[],[f99,f104]) ).

fof(f167,plain,
    fifo_length = int_level(plus(t_139,n1)),
    inference(resolution,[],[f28,f117]) ).

fof(f220,definition,
    ( spl0_8
  <=> fifo_length = int_level(t_139) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f221,plain,
    ( fifo_length != int_level(t_139)
    | spl0_8 ),
    inference(avatar_component_clause,[],[f220]) ).

fof(f222,plain,
    ( fifo_length = int_level(t_139)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f220]) ).

fof(f793,plain,
    ( p_Reset(t_139)
    | gt(int_level(t_139),n0)
    | int_level(t_139) = int_level(plus(t_139,n1)) ),
    inference(resolution,[],[f122,f115]) ).

fof(f798,plain,
    ( gt(int_level(t_139),n0)
    | int_level(t_139) = int_level(plus(t_139,n1)) ),
    inference(forward_subsumption_resolution,[],[f793,f116]) ).

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

fof(f1079,plain,
    ( gt(int_level(t_139),n0)
    | ~ spl0_51 ),
    inference(avatar_component_clause,[],[f1078]) ).

fof(f1080,plain,
    ( ~ gt(int_level(t_139),n0)
    | spl0_51 ),
    inference(avatar_component_clause,[],[f1078]) ).

fof(f1085,plain,
    ( fifo_length = int_level(t_139)
    | gt(int_level(t_139),n0) ),
    inference(forward_demodulation,[],[f798,f167]) ).

fof(f1395,plain,
    ( ~ gt(fifo_length,n0)
    | ~ spl0_8
    | spl0_51 ),
    inference(forward_demodulation,[],[f1080,f222]) ).

fof(f1417,plain,
    ( $false
    | ~ spl0_8
    | spl0_51 ),
    inference(forward_subsumption_resolution,[],[f1395,f118]) ).

fof(f1418,plain,
    ( ~ spl0_8
    | spl0_51 ),
    inference(avatar_contradiction_clause,[],[f1417]) ).

fof(f1451,plain,
    ( gt(int_level(t_139),n0)
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f1085,f221]) ).

fof(f1452,plain,
    ( $false
    | spl0_8
    | spl0_51 ),
    inference(forward_subsumption_resolution,[],[f1451,f1080]) ).

fof(f1453,plain,
    ( spl0_8
    | spl0_51 ),
    inference(avatar_contradiction_clause,[],[f1452]) ).

fof(f1520,plain,
    ( p_Wr(t_139)
    | p_Reset(t_139)
    | ~ gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(resolution,[],[f90,f114]) ).

fof(f1536,plain,
    ( p_Reset(t_139)
    | ~ gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(forward_subsumption_resolution,[],[f1520,f115]) ).

fof(f1537,plain,
    ( ~ gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(forward_subsumption_resolution,[],[f1536,f116]) ).

fof(f1538,plain,
    ( int_level(plus(t_139,n1)) = minus(int_level(t_139),n1)
    | ~ spl0_51 ),
    inference(forward_subsumption_resolution,[],[f1537,f1079]) ).

fof(f1539,plain,
    ( fifo_length = minus(int_level(t_139),n1)
    | ~ spl0_51 ),
    inference(forward_demodulation,[],[f1538,f167]) ).

fof(f1604,plain,
    ( gt(int_level(t_139),minus(int_level(t_139),n1))
    | ~ spl0_51 ),
    inference(resolution,[],[f1079,f3]) ).

fof(f1611,plain,
    ( gt(int_level(t_139),fifo_length)
    | ~ spl0_51 ),
    inference(forward_demodulation,[],[f1604,f1539]) ).

fof(f1613,plain,
    ( $false
    | ~ spl0_51 ),
    inference(forward_subsumption_resolution,[],[f1611,f119]) ).

fof(f1614,plain,
    ~ spl0_51,
    inference(avatar_contradiction_clause,[],[f1613]) ).

cnf(s70,plain,
    ( ~ spl0_8
    | spl0_51 ),
    inference(sat_conversion,[],[f1418]) ).

cnf(s80,plain,
    ( spl0_8
    | spl0_51 ),
    inference(sat_conversion,[],[f1453]) ).

cnf(s83,plain,
    ~ spl0_51,
    inference(sat_conversion,[],[f1614]) ).

cnf(s85,plain,
    spl0_8,
    inference(rat,[],[s80,s83]) ).

cnf(s87,plain,
    $false,
    inference(rat,[],[s70,s83,s85]) ).

fof(f1624,plain,
    $false,
    inference(avatar_sat_refutation,[],[s87]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV017-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.38  % Computer : n005.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 10:53:17 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.16/0.49  % (3815626)Will run a generic schedule for satisfiability detection.
% 0.16/0.49  % (3815635)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3518511942:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.49  % (3815632)% WARNING: option uhcvi not known.
% 0.16/0.49  % (3815631)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2006128572_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.49  % (3815632)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2702201619:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.16/0.49  % (3815633)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3142353591:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.16/0.49  % (3815634)dis+10_1_sil=32000:sp=arity:random_seed=1690922937:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.16/0.49  % (3815636)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3672551823:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.16/0.49  % (3815637)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=450318632:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.16/0.49  % TRYING [1]
% 0.16/0.49  % TRYING [2]
% 0.16/0.49  % TRYING [3]
% 0.16/0.49  % TRYING [4]
% 0.16/0.49  % (3815635)Instruction limit reached! 
% 0.16/0.49  % (3815635)------------------------------
% 0.16/0.49  % (3815635)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49  % (3815635)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49  % (3815635)CaDiCaL version: 2.1.3
% 0.16/0.49  % (3815635)Termination reason: Instruction limit
% 0.16/0.49  % (3815635)Termination phase: Saturation
% 0.16/0.49  % (3815635)Time elapsed: 0.036 s
% 0.16/0.49  % (3815635)Peak memory usage: 12 MB
% 0.16/0.49  % (3815635)Instructions burned: 118 (million)
% 0.16/0.49  % TRYING [5]
% 0.16/0.49  % (3815636) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3815626-3815636"...
% 0.16/0.49  % (3815636)...printing done.
% 0.16/0.49  % (3815636)Refutation found. Thanks to Tanya!
% 0.16/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.49  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49  % (3815636)------------------------------
% 0.16/0.49  % (3815636)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.49  % (3815636)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.49  % (3815636)CaDiCaL version: 2.1.3
% 0.16/0.49  % (3815636)Termination reason: Refutation
% 0.16/0.49  % (3815636)Time elapsed: 0.035 s
% 0.16/0.49  % (3815636)Peak memory usage: 13 MB
% 0.16/0.49  % (3815636)Instructions burned: 51 (million)
% 0.16/0.49  % (3815626)Success in time 0.07 s
% 0.16/0.49  % Vampire exiting
%------------------------------------------------------------------------------