%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : HWV016-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 1.47s 1.21s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 75 ( 12 unt; 3 def)
% Number of atoms : 210 ( 49 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 220 ( 85 ~; 132 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 4 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : plus(X0,n1) != n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f16,axiom,
! [X2,X0,X1] :
( gt(X0,X2)
| ~ gt(X0,X1)
| ~ gt(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_13) ).
fof(f17,axiom,
! [X0,X1] :
( gt(X0,plus(X1,n1))
| plus(X1,n1) = X0
| ~ gt(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).
fof(f18,axiom,
! [X0] :
( X0 = n0
| gt(X0,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_15) ).
fof(f19,plain,
! [X0] :
( gt(X0,n0)
| n0 = X0 ),
inference(reorient_equations,[],[f18]) ).
fof(f26,axiom,
! [X0] : level(X0) = int_level(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_21) ).
fof(f31,axiom,
! [X0] :
( int_level(X0) = n0
| ~ p_Empty(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_25) ).
fof(f32,plain,
! [X0] :
( ~ p_Empty(X0)
| n0 = int_level(X0) ),
inference(reorient_equations,[],[f31]) ).
fof(f45,axiom,
! [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) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_35) ).
fof(f57,axiom,
! [X0] :
( p_Reset(X0)
| ~ p_Wr(X0)
| p_Rd(X0)
| gt(fifo_length,int_level(X0))
| int_level(plus(X0,n1)) = int_level(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_44) ).
fof(f58,plain,
! [X0] :
( p_Reset(X0)
| ~ p_Wr(X0)
| p_Rd(X0)
| gt(fifo_length,int_level(X0))
| int_level(X0) = int_level(plus(X0,n1)) ),
inference(reorient_equations,[],[f57]) ).
fof(f67,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/sandbox/benchmark/theBenchmark.p',axiom_53) ).
fof(f68,plain,
! [X0] :
( ~ gt(int_level(X0),n0)
| ~ p_Wr(X0)
| ~ p_Rd(X0)
| p_Reset(X0)
| int_level(X0) = int_level(plus(X0,n1)) ),
inference(reorient_equations,[],[f67]) ).
fof(f75,axiom,
! [X0] :
( gt(int_level(X0),n0)
| ~ p_Wr(X0)
| ~ p_Rd(X0)
| p_Reset(X0)
| int_level(plus(X0,n1)) = plus(int_level(X0),n1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_59) ).
fof(f103,axiom,
! [X0] :
( p_Reset(X0)
| p_Wr(X0)
| p_Rd(X0)
| int_level(plus(X0,n1)) = int_level(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_82) ).
fof(f104,plain,
! [X0] :
( p_Wr(X0)
| p_Reset(X0)
| p_Rd(X0)
| int_level(X0) = int_level(plus(X0,n1)) ),
inference(reorient_equations,[],[f103]) ).
fof(f113,negated_conjecture,
~ gt(n0,level(t_139)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
fof(f114,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
fof(f115,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
fof(f116,negated_conjecture,
p_Empty(plus(t_139,n1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
fof(f117,negated_conjecture,
gt(fifo_length,n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
fof(f125,plain,
n0 = int_level(plus(t_139,n1)),
inference(resolution,[],[f32,f116]) ).
fof(f141,plain,
! [X0] :
( ~ gt(n0,X0)
| ~ gt(X0,level(t_139)) ),
inference(resolution,[],[f16,f113]) ).
fof(f144,plain,
! [X0] :
( ~ gt(X0,int_level(t_139))
| ~ gt(n0,X0) ),
inference(forward_demodulation,[],[f141,f26]) ).
fof(f203,definition,
( spl0_6
<=> n0 = int_level(t_139) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f205,plain,
( n0 = int_level(t_139)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f203]) ).
fof(f304,plain,
( ! [X0] :
( ~ gt(n0,X0)
| ~ gt(X0,n0) )
| ~ spl0_6 ),
inference(superposition,[],[f144,f205]) ).
fof(f345,plain,
( ! [X0] :
( ~ gt(plus(X0,n1),n0)
| plus(X0,n1) = n0
| ~ gt(n0,X0) )
| ~ spl0_6 ),
inference(resolution,[],[f304,f17]) ).
fof(f349,plain,
( ! [X0] :
( plus(X0,n1) = n0
| ~ gt(n0,X0) )
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f345,f19]) ).
fof(f354,plain,
( ! [X0] : ~ gt(n0,X0)
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f349,f1]) ).
fof(f664,plain,
! [X0] :
( p_Rd(X0)
| p_Reset(X0)
| gt(fifo_length,int_level(X0))
| int_level(X0) = int_level(plus(X0,n1)) ),
inference(forward_subsumption_resolution,[],[f58,f104]) ).
fof(f674,plain,
! [X0] :
( p_Reset(X0)
| ~ p_Rd(X0)
| ~ p_Wr(X0)
| int_level(X0) = int_level(plus(X0,n1))
| n0 = int_level(X0) ),
inference(resolution,[],[f68,f19]) ).
fof(f753,definition,
( spl0_59
<=> p_Rd(t_139) ),
introduced(definition,[new_symbols(definition,[spl0_59])],[avatar_definition]) ).
fof(f754,plain,
( p_Rd(t_139)
| ~ spl0_59 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f755,plain,
( ~ p_Rd(t_139)
| spl0_59 ),
inference(avatar_component_clause,[],[f753]) ).
fof(f792,plain,
( p_Reset(t_139)
| gt(fifo_length,int_level(t_139))
| int_level(t_139) = int_level(plus(t_139,n1))
| spl0_59 ),
inference(resolution,[],[f755,f664]) ).
fof(f793,plain,
( gt(fifo_length,int_level(t_139))
| int_level(t_139) = int_level(plus(t_139,n1))
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f792,f115]) ).
fof(f929,plain,
( ~ p_Wr(t_139)
| p_Reset(t_139)
| ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| spl0_59 ),
inference(resolution,[],[f45,f755]) ).
fof(f931,plain,
( p_Reset(t_139)
| ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f929,f114]) ).
fof(f932,plain,
( ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f931,f115]) ).
fof(f933,plain,
( ~ gt(fifo_length,n0)
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_6
| spl0_59 ),
inference(forward_demodulation,[],[f932,f205]) ).
fof(f934,plain,
( int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_6
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f933,f117]) ).
fof(f935,plain,
( plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6
| spl0_59 ),
inference(forward_demodulation,[],[f934,f205]) ).
fof(f936,plain,
( n0 = plus(n0,n1)
| ~ spl0_6
| spl0_59 ),
inference(forward_demodulation,[],[f935,f125]) ).
fof(f937,plain,
( $false
| ~ spl0_6
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f936,f1]) ).
fof(f938,plain,
( ~ spl0_6
| spl0_59 ),
inference(avatar_contradiction_clause,[],[f937]) ).
fof(f940,plain,
( n0 = int_level(t_139)
| gt(fifo_length,int_level(t_139))
| spl0_59 ),
inference(forward_demodulation,[],[f793,f125]) ).
fof(f946,definition,
( spl0_73
<=> gt(fifo_length,int_level(t_139)) ),
introduced(definition,[new_symbols(definition,[spl0_73])],[avatar_definition]) ).
fof(f952,plain,
( n0 = plus(int_level(t_139),n1)
| ~ gt(fifo_length,int_level(t_139))
| spl0_59 ),
inference(forward_demodulation,[],[f932,f125]) ).
fof(f953,plain,
( spl0_73
| spl0_6
| spl0_59 ),
inference(avatar_split_clause,[],[f940,f753,f203,f946]) ).
fof(f955,plain,
( ~ gt(fifo_length,int_level(t_139))
| spl0_59 ),
inference(forward_subsumption_resolution,[],[f952,f1]) ).
fof(f956,plain,
( ~ spl0_73
| spl0_59 ),
inference(avatar_split_clause,[],[f955,f753,f946]) ).
fof(f1937,plain,
( ~ p_Rd(t_139)
| ~ p_Wr(t_139)
| int_level(t_139) = int_level(plus(t_139,n1))
| n0 = int_level(t_139) ),
inference(resolution,[],[f674,f115]) ).
fof(f1938,plain,
( ~ p_Wr(t_139)
| int_level(t_139) = int_level(plus(t_139,n1))
| n0 = int_level(t_139)
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f1937,f754]) ).
fof(f1939,plain,
( int_level(t_139) = int_level(plus(t_139,n1))
| n0 = int_level(t_139)
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f1938,f114]) ).
fof(f1950,plain,
( n0 = int_level(t_139)
| n0 = int_level(t_139)
| ~ spl0_59 ),
inference(forward_demodulation,[],[f1939,f125]) ).
fof(f1951,plain,
( n0 = int_level(t_139)
| ~ spl0_59 ),
inference(duplicate_literal_removal,[],[f1950]) ).
fof(f1953,plain,
( spl0_6
| ~ spl0_59 ),
inference(avatar_split_clause,[],[f1951,f753,f203]) ).
fof(f2025,plain,
( gt(n0,n0)
| ~ p_Wr(t_139)
| ~ p_Rd(t_139)
| p_Reset(t_139)
| plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6 ),
inference(superposition,[],[f75,f205]) ).
fof(f2033,plain,
( ~ p_Wr(t_139)
| ~ p_Rd(t_139)
| p_Reset(t_139)
| plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f2025,f354]) ).
fof(f2048,plain,
( ~ p_Rd(t_139)
| p_Reset(t_139)
| plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f2033,f114]) ).
fof(f2053,plain,
( p_Reset(t_139)
| plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f2048,f754]) ).
fof(f2057,plain,
( plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_6
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f2053,f115]) ).
fof(f2059,plain,
( n0 = plus(n0,n1)
| ~ spl0_6
| ~ spl0_59 ),
inference(forward_demodulation,[],[f2057,f125]) ).
fof(f2060,plain,
( $false
| ~ spl0_6
| ~ spl0_59 ),
inference(forward_subsumption_resolution,[],[f2059,f1]) ).
fof(f2061,plain,
( ~ spl0_6
| ~ spl0_59 ),
inference(avatar_contradiction_clause,[],[f2060]) ).
cnf(s93,plain,
( ~ spl0_6
| spl0_59 ),
inference(sat_conversion,[],[f938]) ).
cnf(s97,plain,
( spl0_6
| spl0_59
| spl0_73 ),
inference(sat_conversion,[],[f953]) ).
cnf(s98,plain,
( spl0_59
| ~ spl0_73 ),
inference(sat_conversion,[],[f956]) ).
cnf(s253,plain,
( spl0_6
| ~ spl0_59 ),
inference(sat_conversion,[],[f1953]) ).
cnf(s262,plain,
( ~ spl0_6
| ~ spl0_59 ),
inference(sat_conversion,[],[f2061]) ).
cnf(s263,plain,
spl0_6,
inference(rat,[],[s97,s98,s253]) ).
cnf(s264,plain,
~ spl0_59,
inference(rat,[],[s262,s263]) ).
cnf(s266,plain,
$false,
inference(rat,[],[s93,s264,s263]) ).
fof(f2062,plain,
$false,
inference(avatar_sat_refutation,[],[s266]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV016-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n016.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 10:58:16 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.47/1.21 % (2451509)Input is clausal, will run a generic CNF schedule.
% 1.47/1.21 % (2451620)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2573234492:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 1.47/1.21 % (2451620)First to succeed.
% 1.47/1.21 % (2451620)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2451509"
% 1.47/1.21 % (2451616)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4267232027:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 1.47/1.21 % (2451621)dis-21_1_sil=8000:lcm=predicate:random_seed=276470156: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)
% 1.47/1.21 % (2451615)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=215787713:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 1.47/1.21 % (2451617)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3533722589:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 1.47/1.21 % (2451618)lrs+10_1_sil=8000:sp=occurrence:random_seed=4054798090:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 1.47/1.21 % (2451619)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2186995990:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 1.47/1.21 % (2451618)Also succeeded, but the first one will report.
% 1.47/1.21 % (2451619)Also succeeded, but the first one will report.
% 1.47/1.21 % (2451621)Instruction limit reached!
% 1.47/1.21 % (2451621)------------------------------
% 1.47/1.21 % (2451621)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.47/1.21 % (2451621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.47/1.21 % (2451621)CaDiCaL version: 2.1.3
% 1.47/1.21 % (2451621)Termination reason: Instruction limit
% 1.47/1.21 % (2451621)Termination phase: Saturation
% 1.47/1.21 % (2451621)Time elapsed: 0.072 s
% 1.47/1.21 % (2451621)Peak memory usage: 88 MB
% 1.47/1.21 % (2451621)Instructions burned: 118 (million)
% 1.47/1.21 % (2451620)Refutation found. Thanks to Tanya!
% 1.47/1.21 % SZS status Unsatisfiable for theBenchmark
% 1.47/1.21 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.40 % (2451620)------------------------------
% 0.18/1.40 % (2451620)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.40 % (2451620)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.40 % (2451620)CaDiCaL version: 2.1.3
% 0.18/1.40 % (2451620)Termination reason: Refutation
% 0.18/1.40 % (2451620)Time elapsed: 0.025 s
% 0.18/1.40 % (2451620)Peak memory usage: 90 MB
% 0.18/1.40 % (2451620)Instructions burned: 59 (million)
% 0.18/1.40 % (2451620)------------------------------
% 0.18/1.40 % (2451620)------------------------------
% 0.18/1.40 % (2451509)Success in time 0.338 s
% 0.18/1.40 % Vampire exiting
%------------------------------------------------------------------------------