↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---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 THM

% Computer : n004.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:20:13 AM UTC 2026

% Result   : Unsatisfiable 3.75s 1.41s
% Output   : Refutation 3.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   48 (  19 unt;   1 def)
%            Number of atoms       :  117 (  22 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  113 (  44   ~;  68   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn  12   !;   0   ?)

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

fof(f22,axiom,
    ! [X0] : ~ gt(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_17) ).

fof(f26,axiom,
    ! [X0] : level(X0) = int_level(X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_21) ).

fof(f28,axiom,
    ! [X0] :
      ( ~ p_Full(X0)
      | int_level(X0) = fifo_length ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_23) ).

fof(f90,axiom,
    ! [X0] :
      ( int_level(plus(X0,n1)) = minus(int_level(X0),n1)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | p_Reset(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',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/theBenchmark.p',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/theBenchmark.p',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(f124,plain,
    ~ gt(int_level(t_139),fifo_length),
    inference(superposition,[],[f113,f26]) ).

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

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

fof(f139,plain,
    ( fifo_length != int_level(t_139)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f138]) ).

fof(f140,plain,
    ( fifo_length = int_level(t_139)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f138]) ).

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

fof(f929,plain,
    ( minus(fifo_length,n1) = int_level(plus(t_139,n1))
    | p_Wr(t_139)
    | ~ p_Rd(t_139)
    | ~ gt(fifo_length,n0)
    | p_Reset(t_139)
    | ~ spl0_2 ),
    inference(superposition,[],[f90,f140]) ).

fof(f930,plain,
    ! [X0] :
      ( gt(int_level(X0),int_level(plus(X0,n1)))
      | ~ gt(int_level(X0),n0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | p_Reset(X0) ),
    inference(superposition,[],[f3,f90]) ).

fof(f931,plain,
    ! [X0] :
      ( gt(int_level(X0),int_level(plus(X0,n1)))
      | ~ gt(int_level(X0),n0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | p_Reset(X0) ),
    inference(duplicate_literal_removal,[],[f930]) ).

fof(f932,plain,
    ( minus(fifo_length,n1) = int_level(plus(t_139,n1))
    | ~ p_Rd(t_139)
    | ~ gt(fifo_length,n0)
    | p_Reset(t_139)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f929,f115]) ).

fof(f934,plain,
    ( minus(fifo_length,n1) = int_level(plus(t_139,n1))
    | ~ gt(fifo_length,n0)
    | p_Reset(t_139)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f932,f114]) ).

fof(f936,plain,
    ( minus(fifo_length,n1) = int_level(plus(t_139,n1))
    | p_Reset(t_139)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f934,f118]) ).

fof(f938,plain,
    ( minus(fifo_length,n1) = int_level(plus(t_139,n1))
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f936,f116]) ).

fof(f944,plain,
    ( fifo_length = minus(fifo_length,n1)
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f938,f126]) ).

fof(f989,plain,
    ( gt(fifo_length,fifo_length)
    | ~ gt(fifo_length,n0)
    | ~ spl0_2 ),
    inference(superposition,[],[f3,f944]) ).

fof(f990,plain,
    ( ~ gt(fifo_length,n0)
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f989,f22]) ).

fof(f993,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f990,f118]) ).

fof(f994,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f993]) ).

fof(f1855,plain,
    ( gt(int_level(t_139),fifo_length)
    | ~ gt(int_level(t_139),n0)
    | p_Wr(t_139)
    | ~ p_Rd(t_139)
    | p_Reset(t_139) ),
    inference(superposition,[],[f931,f126]) ).

fof(f1856,plain,
    ( ~ gt(int_level(t_139),n0)
    | p_Wr(t_139)
    | ~ p_Rd(t_139)
    | p_Reset(t_139) ),
    inference(forward_subsumption_resolution,[],[f1855,f124]) ).

fof(f1858,plain,
    ( ~ gt(int_level(t_139),n0)
    | ~ p_Rd(t_139)
    | p_Reset(t_139) ),
    inference(forward_subsumption_resolution,[],[f1856,f115]) ).

fof(f1860,plain,
    ( ~ gt(int_level(t_139),n0)
    | p_Reset(t_139) ),
    inference(forward_subsumption_resolution,[],[f1858,f114]) ).

fof(f1862,plain,
    ~ gt(int_level(t_139),n0),
    inference(forward_subsumption_resolution,[],[f1860,f116]) ).

fof(f1865,plain,
    ( p_Wr(t_139)
    | p_Reset(t_139)
    | int_level(t_139) = int_level(plus(t_139,n1)) ),
    inference(resolution,[],[f1862,f740]) ).

fof(f1887,plain,
    ( p_Reset(t_139)
    | int_level(t_139) = int_level(plus(t_139,n1)) ),
    inference(forward_subsumption_resolution,[],[f1865,f115]) ).

fof(f1890,plain,
    int_level(t_139) = int_level(plus(t_139,n1)),
    inference(forward_subsumption_resolution,[],[f1887,f116]) ).

fof(f1893,plain,
    fifo_length = int_level(t_139),
    inference(forward_demodulation,[],[f1890,f126]) ).

fof(f1894,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f1893,f139]) ).

fof(f1895,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f1894]) ).

cnf(s98,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f994]) ).

cnf(s197,plain,
    spl0_2,
    inference(sat_conversion,[],[f1895]) ).

cnf(s199,plain,
    $false,
    inference(rat,[],[s98,s197]) ).

fof(f1896,plain,
    $false,
    inference(avatar_sat_refutation,[],[s199]) ).

%------------------------------------------------------------------------------
%----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 THM
% 0.12/0.38  % Computer : n004.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:22 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.75/1.41  % (3343718)Input is clausal, will run a generic CNF schedule.
% 3.75/1.41  % (3343729)dis-21_1_sil=8000:lcm=predicate:random_seed=3926603023:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.75/1.41  % (3343729)Instruction limit reached! 
% 3.75/1.41  % (3343729)------------------------------
% 3.75/1.41  % (3343729)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343729)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343729)Termination reason: Instruction limit
% 3.75/1.41  % (3343729)Termination phase: Saturation
% 3.75/1.41  % (3343729)Time elapsed: 0.027 s
% 3.75/1.41  % (3343729)Peak memory usage: 88 MB
% 3.75/1.41  % (3343729)Instructions burned: 118 (million)
% 3.75/1.41  % (3343723)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3492399049:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.75/1.41  % (3343724)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2635396996:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.75/1.41  % (3343725)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=956103387:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.75/1.41  % (3343727)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4042263427:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.75/1.41  % (3343726)lrs+10_1_sil=8000:sp=occurrence:random_seed=944998134:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.75/1.41  % (3343728)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3478301756:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.75/1.41  % (3343728)First to succeed.
% 3.75/1.41  % (3343728)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3343718"
% 3.75/1.41  % (3343732)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=4241116536:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.75/1.41  % (3343726)Instruction limit reached! 
% 3.75/1.41  % (3343726)------------------------------
% 3.75/1.41  % (3343726)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343726)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343726)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343726)Termination reason: Instruction limit
% 3.75/1.41  % (3343726)Termination phase: Saturation
% 3.75/1.41  % (3343726)Time elapsed: 0.067 s
% 3.75/1.41  % (3343726)Peak memory usage: 88 MB
% 3.75/1.41  % (3343726)Instructions burned: 108 (million)
% 3.75/1.41  % (3343727)Instruction limit reached! 
% 3.75/1.41  % (3343727)------------------------------
% 3.75/1.41  % (3343727)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343727)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343727)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343727)Termination reason: Instruction limit
% 3.75/1.41  % (3343727)Termination phase: Saturation
% 3.75/1.41  % (3343727)Time elapsed: 0.080 s
% 3.75/1.41  % (3343727)Peak memory usage: 89 MB
% 3.75/1.41  % (3343727)Instructions burned: 115 (million)
% 3.75/1.41  % (3343732)Instruction limit reached! 
% 3.75/1.41  % (3343732)------------------------------
% 3.75/1.41  % (3343732)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343732)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343732)Termination reason: Instruction limit
% 3.75/1.41  % (3343732)Termination phase: Saturation
% 3.75/1.41  % (3343732)Time elapsed: 0.031 s
% 3.75/1.41  % (3343732)Peak memory usage: 88 MB
% 3.75/1.41  % (3343732)Instructions burned: 145 (million)
% 3.75/1.41  % (3343741)lrs+10_64_to=lpo:sil=8000:random_seed=1582022572:i=126:bd=preordered_2997 on theBenchmark for (2997ds/126Mi)
% 3.75/1.41  % (3343740)lrs-1002_1_to=lpo:sil=8000:fde=none:sos=on:random_seed=1400645914:st=4:i=219:sd=3:ss=axioms_2997 on theBenchmark for (2997ds/219Mi)
% 3.75/1.41  % (3343739)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1588106966:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 3.75/1.41  % (3343739)Also succeeded, but the first one will report.
% 3.75/1.41  % (3343741)Instruction limit reached! 
% 3.75/1.41  % (3343741)------------------------------
% 3.75/1.41  % (3343741)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343741)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343741)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343741)Termination reason: Instruction limit
% 3.75/1.41  % (3343741)Termination phase: Saturation
% 3.75/1.41  % (3343741)Time elapsed: 0.037 s
% 3.75/1.41  % (3343741)Peak memory usage: 88 MB
% 3.75/1.41  % (3343741)Instructions burned: 129 (million)
% 3.75/1.41  % (3343740)Also succeeded, but the first one will report.
% 3.75/1.41  % (3343728)Refutation found. Thanks to Tanya!
% 3.75/1.41  % SZS status Unsatisfiable for theBenchmark
% 3.75/1.41  % SZS output start Proof for theBenchmark
% See solution above
% 3.75/1.41  % (3343728)------------------------------
% 3.75/1.41  % (3343728)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.75/1.41  % (3343728)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.75/1.41  % (3343728)CaDiCaL version: 2.1.3
% 3.75/1.41  % (3343728)Termination reason: Refutation
% 3.75/1.41  % (3343728)Time elapsed: 0.040 s
% 3.75/1.41  % (3343728)Peak memory usage: 90 MB
% 3.75/1.41  % (3343728)Instructions burned: 53 (million)
% 3.75/1.41  % (3343728)------------------------------
% 3.75/1.41  % (3343728)------------------------------
% 3.75/1.41  % (3343718)Success in time 0.452 s
% 3.75/1.41  % Vampire exiting
%------------------------------------------------------------------------------