%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : HWV020-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 : n013.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:58 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.45s
% Output : Refutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 43 ( 14 unt; 2 def)
% Number of atoms : 96 ( 16 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 76 ( 23 ~; 51 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_17) ).
fof(f29,axiom,
! [X0] :
( int_level(X0) != n0
| p_Empty(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_24) ).
fof(f30,plain,
! [X0] :
( p_Empty(X0)
| n0 != int_level(X0) ),
inference(reorient_equations,[],[f29]) ).
fof(f31,axiom,
! [X0] :
( int_level(X0) = n0
| ~ p_Empty(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_25) ).
fof(f32,plain,
! [X0] :
( ~ p_Empty(X0)
| n0 = int_level(X0) ),
inference(reorient_equations,[],[f31]) ).
fof(f74,axiom,
! [X0] :
( p_Reset(X0)
| ~ p_Wr(X0)
| ~ p_Rd(X0)
| gt(int_level(X0),n0)
| p_Rd_error(plus(X0,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_58) ).
fof(f96,axiom,
! [X0] :
( p_Rd_error(plus(X0,n1))
| p_Wr(X0)
| ~ p_Rd(X0)
| gt(int_level(X0),n0)
| p_Reset(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/HWV003-0.ax',axiom_76) ).
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,
p_Rd(t_139),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_1) ).
fof(f114,negated_conjecture,
p_Empty(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_Empty(plus(t_139,n1))
| ~ p_Rd_error(plus(t_139,n1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quest_5) ).
fof(f122,definition,
( spl0_1
<=> p_Rd_error(plus(t_139,n1)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f124,plain,
( ~ p_Rd_error(plus(t_139,n1))
| spl0_1 ),
inference(avatar_component_clause,[],[f122]) ).
fof(f126,definition,
( spl0_2
<=> p_Empty(plus(t_139,n1)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f128,plain,
( ~ p_Empty(plus(t_139,n1))
| spl0_2 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f129,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f117,f126,f122]) ).
fof(f132,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(f136,plain,
! [X0] :
( p_Rd_error(plus(X0,n1))
| ~ p_Rd(X0)
| gt(int_level(X0),n0)
| p_Reset(X0) ),
inference(forward_subsumption_resolution,[],[f74,f96]) ).
fof(f174,plain,
n0 = int_level(t_139),
inference(resolution,[],[f32,f114]) ).
fof(f481,plain,
( ~ p_Rd(t_139)
| gt(int_level(t_139),n0)
| p_Reset(t_139)
| spl0_1 ),
inference(resolution,[],[f136,f124]) ).
fof(f493,plain,
( gt(int_level(t_139),n0)
| p_Reset(t_139)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f481,f113]) ).
fof(f495,plain,
( gt(int_level(t_139),n0)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f493,f116]) ).
fof(f497,plain,
( gt(n0,n0)
| spl0_1 ),
inference(forward_demodulation,[],[f495,f174]) ).
fof(f498,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f497,f22]) ).
fof(f499,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f498]) ).
fof(f506,plain,
( n0 != int_level(plus(t_139,n1))
| spl0_2 ),
inference(resolution,[],[f128,f30]) ).
fof(f716,plain,
( p_Reset(t_139)
| gt(int_level(t_139),n0)
| int_level(t_139) = int_level(plus(t_139,n1)) ),
inference(resolution,[],[f132,f115]) ).
fof(f717,plain,
( gt(int_level(t_139),n0)
| int_level(t_139) = int_level(plus(t_139,n1)) ),
inference(forward_subsumption_resolution,[],[f716,f116]) ).
fof(f718,plain,
( gt(n0,n0)
| int_level(t_139) = int_level(plus(t_139,n1)) ),
inference(forward_demodulation,[],[f717,f174]) ).
fof(f719,plain,
int_level(t_139) = int_level(plus(t_139,n1)),
inference(forward_subsumption_resolution,[],[f718,f22]) ).
fof(f720,plain,
n0 = int_level(plus(t_139,n1)),
inference(forward_demodulation,[],[f719,f174]) ).
fof(f721,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f720,f506]) ).
fof(f722,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f721]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f129]) ).
cnf(s21,plain,
spl0_1,
inference(sat_conversion,[],[f499]) ).
cnf(s25,plain,
spl0_2,
inference(sat_conversion,[],[f722]) ).
cnf(s26,plain,
$false,
inference(rat,[],[s1,s25,s21]) ).
fof(f723,plain,
$false,
inference(avatar_sat_refutation,[],[s26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV020-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.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 27 10:53:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.10/0.45 % (47651)Will run a generic schedule for satisfiability detection.
% 0.10/0.45 % (47660)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=423753999:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.45 % (47657)% WARNING: option uhcvi not known.
% 0.10/0.45 % (47656)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3470365493_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.45 % (47658)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2786886802:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.45 % (47659)dis+10_1_sil=32000:sp=arity:random_seed=1655853469:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.45 % (47661)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3016454224:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.45 % (47662)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2615890467:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.45 % (47657)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1490032563:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.45 % (47660) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-47651-47660"...
% 0.10/0.45 % (47660)...printing done.
% 0.10/0.45 % (47660)Refutation found. Thanks to Tanya!
% 0.10/0.45 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.45 % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.45 % (47660)------------------------------
% 0.10/0.45 % (47660)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.45 % (47660)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.45 % (47660)CaDiCaL version: 2.1.3
% 0.10/0.45 % (47660)Termination reason: Refutation
% 0.10/0.45 % (47660)Time elapsed: 0.010 s
% 0.10/0.45 % (47660)Peak memory usage: 12 MB
% 0.10/0.45 % (47660)Instructions burned: 26 (million)
% 0.10/0.45 % (47651)Success in time 0.045 s
% 0.10/0.45 % Vampire exiting
%------------------------------------------------------------------------------