%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n011.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.18s 0.47s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 19
% Syntax : Number of formulae : 77 ( 12 unt; 3 def)
% Number of atoms : 201 ( 44 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 191 ( 67 ~; 121 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 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 : 20 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : plus(X0,n1) != n0,
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_1) ).
fof(f9,axiom,
! [X0,X1] :
( ~ gt(X0,X1)
| gt(plus(X0,n1),plus(X1,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_8) ).
fof(f18,axiom,
! [X0] :
( X0 = n0
| gt(X0,n0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_15) ).
fof(f19,plain,
! [X0] :
( gt(X0,n0)
| n0 = X0 ),
inference(reorient_equations,[],[f18]) ).
fof(f20,axiom,
! [X0] :
( X0 = n0
| X0 = plus(y_27(X0),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_16) ).
fof(f21,plain,
! [X0] :
( n0 = X0
| plus(y_27(X0),n1) = X0 ),
inference(reorient_equations,[],[f20]) ).
fof(f22,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
fof(f25,axiom,
n1 = plus(n0,n1),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_20) ).
fof(f31,axiom,
! [X0] :
( int_level(X0) = n0
| ~ p_Empty(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_25) ).
fof(f32,plain,
! [X0] :
( ~ p_Empty(X0)
| n0 = int_level(X0) ),
inference(reorient_equations,[],[f31]) ).
fof(f45,axiom,
! [X0] :
( ~ p_Wr(X0)
| p_Reset(X0)
| p_Rd(X0)
| ~ gt(fifo_length,int_level(X0))
| int_level(plus(X0,n1)) = plus(int_level(X0),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',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/Axioms/HWV003-0.ax',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/Axioms/HWV003-0.ax',axiom_53) ).
fof(f68,plain,
! [X0] :
( ~ p_Rd(X0)
| ~ p_Wr(X0)
| p_Reset(X0)
| ~ gt(int_level(X0),n0)
| int_level(X0) = int_level(plus(X0,n1)) ),
inference(reorient_equations,[],[f67]) ).
fof(f75,axiom,
! [X0] :
( ~ p_Rd(X0)
| ~ p_Wr(X0)
| p_Reset(X0)
| gt(int_level(X0),n0)
| int_level(plus(X0,n1)) = plus(int_level(X0),n1) ),
file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',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/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(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(f137,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(f166,plain,
n0 = int_level(plus(t_139,n1)),
inference(resolution,[],[f32,f116]) ).
fof(f235,plain,
! [X0] :
( gt(fifo_length,X0)
| plus(y_27(X0),n1) = X0 ),
inference(superposition,[],[f117,f21]) ).
fof(f374,definition,
( spl0_20
<=> gt(fifo_length,int_level(t_139)) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f375,plain,
( gt(fifo_length,int_level(t_139))
| ~ spl0_20 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f376,plain,
( ~ gt(fifo_length,int_level(t_139))
| spl0_20 ),
inference(avatar_component_clause,[],[f374]) ).
fof(f596,definition,
( spl0_29
<=> p_Rd(t_139) ),
introduced(definition,[new_symbols(definition,[spl0_29])],[avatar_definition]) ).
fof(f597,plain,
( ~ p_Rd(t_139)
| spl0_29 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f598,plain,
( p_Rd(t_139)
| ~ spl0_29 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f800,definition,
( spl0_55
<=> gt(int_level(t_139),n0) ),
introduced(definition,[new_symbols(definition,[spl0_55])],[avatar_definition]) ).
fof(f801,plain,
( gt(int_level(t_139),n0)
| ~ spl0_55 ),
inference(avatar_component_clause,[],[f800]) ).
fof(f802,plain,
( ~ gt(int_level(t_139),n0)
| spl0_55 ),
inference(avatar_component_clause,[],[f800]) ).
fof(f834,plain,
( p_Reset(t_139)
| gt(fifo_length,int_level(t_139))
| int_level(t_139) = int_level(plus(t_139,n1))
| spl0_29 ),
inference(resolution,[],[f137,f597]) ).
fof(f922,plain,
( gt(fifo_length,int_level(t_139))
| int_level(t_139) = int_level(plus(t_139,n1))
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f834,f115]) ).
fof(f924,plain,
( int_level(t_139) = int_level(plus(t_139,n1))
| spl0_20
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f922,f376]) ).
fof(f926,plain,
( n0 = int_level(t_139)
| spl0_20
| spl0_29 ),
inference(forward_demodulation,[],[f924,f166]) ).
fof(f952,plain,
( int_level(t_139) = plus(y_27(int_level(t_139)),n1)
| spl0_20 ),
inference(resolution,[],[f376,f235]) ).
fof(f953,plain,
( n0 = plus(y_27(n0),n1)
| spl0_20
| spl0_29 ),
inference(forward_demodulation,[],[f952,f926]) ).
fof(f954,plain,
( $false
| spl0_20
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f953,f1]) ).
fof(f955,plain,
( spl0_20
| spl0_29 ),
inference(avatar_contradiction_clause,[],[f954]) ).
fof(f1068,plain,
( n0 = int_level(t_139)
| spl0_55 ),
inference(resolution,[],[f802,f19]) ).
fof(f1215,plain,
( ~ p_Wr(t_139)
| p_Reset(t_139)
| ~ gt(int_level(t_139),n0)
| int_level(t_139) = int_level(plus(t_139,n1))
| ~ spl0_29 ),
inference(resolution,[],[f598,f68]) ).
fof(f1253,plain,
( p_Reset(t_139)
| p_Rd(t_139)
| ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1) ),
inference(resolution,[],[f45,f114]) ).
fof(f1273,plain,
( ~ p_Wr(t_139)
| p_Reset(t_139)
| gt(int_level(t_139),n0)
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_29 ),
inference(resolution,[],[f75,f598]) ).
fof(f1279,plain,
( p_Reset(t_139)
| gt(int_level(t_139),n0)
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1273,f114]) ).
fof(f1283,plain,
( gt(int_level(t_139),n0)
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1279,f115]) ).
fof(f1284,plain,
( int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_29
| spl0_55 ),
inference(forward_subsumption_resolution,[],[f1283,f802]) ).
fof(f1285,plain,
( plus(n0,n1) = int_level(plus(t_139,n1))
| ~ spl0_29
| spl0_55 ),
inference(forward_demodulation,[],[f1284,f1068]) ).
fof(f1286,plain,
( n0 = plus(n0,n1)
| ~ spl0_29
| spl0_55 ),
inference(forward_demodulation,[],[f1285,f166]) ).
fof(f1287,plain,
( $false
| ~ spl0_29
| spl0_55 ),
inference(forward_subsumption_resolution,[],[f1286,f1]) ).
fof(f1288,plain,
( ~ spl0_29
| spl0_55 ),
inference(avatar_contradiction_clause,[],[f1287]) ).
fof(f1302,plain,
( p_Reset(t_139)
| ~ gt(int_level(t_139),n0)
| int_level(t_139) = int_level(plus(t_139,n1))
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1215,f114]) ).
fof(f1324,plain,
( ~ gt(int_level(t_139),n0)
| int_level(t_139) = int_level(plus(t_139,n1))
| ~ spl0_29 ),
inference(forward_subsumption_resolution,[],[f1302,f115]) ).
fof(f1327,plain,
( int_level(t_139) = int_level(plus(t_139,n1))
| ~ spl0_29
| ~ spl0_55 ),
inference(forward_subsumption_resolution,[],[f1324,f801]) ).
fof(f1328,plain,
( n0 = int_level(t_139)
| ~ spl0_29
| ~ spl0_55 ),
inference(forward_demodulation,[],[f1327,f166]) ).
fof(f1351,plain,
( gt(plus(int_level(t_139),n1),plus(n0,n1))
| ~ spl0_55 ),
inference(resolution,[],[f801,f9]) ).
fof(f1356,plain,
( gt(plus(int_level(t_139),n1),n1)
| ~ spl0_55 ),
inference(forward_demodulation,[],[f1351,f25]) ).
fof(f1359,plain,
( gt(plus(n0,n1),n1)
| ~ spl0_29
| ~ spl0_55 ),
inference(forward_demodulation,[],[f1356,f1328]) ).
fof(f1361,plain,
( gt(n1,n1)
| ~ spl0_29
| ~ spl0_55 ),
inference(forward_demodulation,[],[f1359,f25]) ).
fof(f1363,plain,
( $false
| ~ spl0_29
| ~ spl0_55 ),
inference(forward_subsumption_resolution,[],[f1361,f22]) ).
fof(f1364,plain,
( ~ spl0_29
| ~ spl0_55 ),
inference(avatar_contradiction_clause,[],[f1363]) ).
fof(f1366,plain,
( p_Rd(t_139)
| ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1) ),
inference(forward_subsumption_resolution,[],[f1253,f115]) ).
fof(f1369,plain,
( ~ gt(fifo_length,int_level(t_139))
| int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f1366,f597]) ).
fof(f1373,plain,
( int_level(plus(t_139,n1)) = plus(int_level(t_139),n1)
| ~ spl0_20
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f1369,f375]) ).
fof(f1375,plain,
( n0 = plus(int_level(t_139),n1)
| ~ spl0_20
| spl0_29 ),
inference(forward_demodulation,[],[f1373,f166]) ).
fof(f1376,plain,
( $false
| ~ spl0_20
| spl0_29 ),
inference(forward_subsumption_resolution,[],[f1375,f1]) ).
fof(f1377,plain,
( ~ spl0_20
| spl0_29 ),
inference(avatar_contradiction_clause,[],[f1376]) ).
cnf(s50,plain,
( spl0_20
| spl0_29 ),
inference(sat_conversion,[],[f955]) ).
cnf(s58,plain,
( ~ spl0_29
| spl0_55 ),
inference(sat_conversion,[],[f1288]) ).
cnf(s66,plain,
( ~ spl0_29
| ~ spl0_55 ),
inference(sat_conversion,[],[f1364]) ).
cnf(s69,plain,
( ~ spl0_20
| spl0_29 ),
inference(sat_conversion,[],[f1377]) ).
cnf(s70,plain,
~ spl0_29,
inference(rat,[],[s58,s66]) ).
cnf(s71,plain,
~ spl0_20,
inference(rat,[],[s69,s70]) ).
cnf(s72,plain,
$false,
inference(rat,[],[s50,s70,s71]) ).
fof(f1378,plain,
$false,
inference(avatar_sat_refutation,[],[s72]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV016-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.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 10:53:30 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.18/0.47 % (2222425)Will run a generic schedule for satisfiability detection.
% 0.18/0.47 % (2222435)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2927860550:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47 % (2222431)% WARNING: option uhcvi not known.
% 0.18/0.47 % (2222430)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=838096703_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47 % (2222432)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1899260526:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47 % (2222431)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1736841531:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47 % (2222433)dis+10_1_sil=32000:sp=arity:random_seed=2274238536:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47 % (2222434)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2423440665:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47 % (2222436)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=913685048:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47 % (2222435) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2222425-2222435"...
% 0.18/0.47 % (2222435)...printing done.
% 0.18/0.47 % (2222435)Refutation found. Thanks to Tanya!
% 0.18/0.47 % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47 % (2222435)------------------------------
% 0.18/0.47 % (2222435)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47 % (2222435)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47 % (2222435)CaDiCaL version: 2.1.3
% 0.18/0.47 % (2222435)Termination reason: Refutation
% 0.18/0.47 % (2222435)Time elapsed: 0.016 s
% 0.18/0.47 % (2222435)Peak memory usage: 13 MB
% 0.18/0.47 % (2222435)Instructions burned: 43 (million)
% 0.18/0.47 % (2222425)Success in time 0.045 s
% 0.18/0.47 % Vampire exiting
%------------------------------------------------------------------------------