%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : HWV020-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 : n014.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:14 AM UTC 2026
% Result : Unsatisfiable 3.60s 1.39s
% Output : Refutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of formulae : 45 ( 14 unt; 2 def)
% Number of atoms : 102 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 82 ( 25 ~; 55 |; 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 : 15 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f22,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).
fof(f29,axiom,
! [X0] :
( int_level(X0) != n0
| p_Empty(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_24) ).
fof(f30,plain,
! [X0] :
( n0 != int_level(X0)
| p_Empty(X0) ),
inference(reorient_equations,[],[f29]) ).
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(f33,axiom,
! [X0] :
( ~ p_Reset(X0)
| int_level(plus(X0,n1)) = n0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_26) ).
fof(f34,plain,
! [X0] :
( ~ p_Reset(X0)
| n0 = int_level(plus(X0,n1)) ),
inference(reorient_equations,[],[f33]) ).
fof(f74,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/sandbox/benchmark/theBenchmark.p',axiom_58) ).
fof(f96,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/sandbox/benchmark/theBenchmark.p',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/sandbox/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/sandbox/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,
p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
fof(f114,negated_conjecture,
p_Empty(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
fof(f115,negated_conjecture,
~ p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
fof(f116,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p',quest_5) ).
fof(f118,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(f122,plain,
! [X0] :
( p_Rd_error(plus(X0,n1))
| ~ p_Rd(X0)
| gt(int_level(X0),n0)
| p_Reset(X0) ),
inference(forward_subsumption_resolution,[],[f96,f74]) ).
fof(f126,definition,
( spl0_1
<=> p_Rd_error(plus(t_139,n1)) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f128,plain,
( ~ p_Rd_error(plus(t_139,n1))
| spl0_1 ),
inference(avatar_component_clause,[],[f126]) ).
fof(f130,definition,
( spl0_2
<=> p_Empty(plus(t_139,n1)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f132,plain,
( ~ p_Empty(plus(t_139,n1))
| spl0_2 ),
inference(avatar_component_clause,[],[f130]) ).
fof(f133,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f117,f130,f126]) ).
fof(f139,plain,
n0 = int_level(t_139),
inference(resolution,[],[f32,f114]) ).
fof(f243,plain,
( ~ p_Rd(t_139)
| gt(int_level(t_139),n0)
| p_Reset(t_139)
| spl0_1 ),
inference(resolution,[],[f122,f128]) ).
fof(f253,plain,
( gt(int_level(t_139),n0)
| p_Reset(t_139)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f243,f113]) ).
fof(f255,plain,
( gt(int_level(t_139),n0)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f253,f116]) ).
fof(f261,plain,
( gt(n0,n0)
| spl0_1 ),
inference(forward_demodulation,[],[f255,f139]) ).
fof(f262,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f261,f22]) ).
fof(f263,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f262]) ).
fof(f323,plain,
( gt(n0,n0)
| p_Wr(t_139)
| p_Reset(t_139)
| n0 = int_level(plus(t_139,n1)) ),
inference(superposition,[],[f118,f139]) ).
fof(f324,plain,
( gt(n0,n0)
| p_Wr(t_139)
| n0 = int_level(plus(t_139,n1)) ),
inference(forward_subsumption_resolution,[],[f323,f34]) ).
fof(f325,plain,
( p_Wr(t_139)
| n0 = int_level(plus(t_139,n1)) ),
inference(forward_subsumption_resolution,[],[f324,f22]) ).
fof(f326,plain,
n0 = int_level(plus(t_139,n1)),
inference(forward_subsumption_resolution,[],[f325,f115]) ).
fof(f328,plain,
( n0 != n0
| p_Empty(plus(t_139,n1)) ),
inference(superposition,[],[f30,f326]) ).
fof(f329,plain,
p_Empty(plus(t_139,n1)),
inference(trivial_inequality_removal,[],[f328]) ).
fof(f330,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f329,f132]) ).
fof(f331,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f330]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f133]) ).
cnf(s6,plain,
spl0_1,
inference(sat_conversion,[],[f263]) ).
cnf(s9,plain,
spl0_2,
inference(sat_conversion,[],[f331]) ).
cnf(s11,plain,
$false,
inference(rat,[],[s1,s9,s6]) ).
fof(f343,plain,
$false,
inference(avatar_sat_refutation,[],[s11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : HWV020-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.10/0.36 % Computer : n014.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 27 10:54:01 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 3.60/1.39 % (622797)Input is clausal, will run a generic CNF schedule.
% 3.60/1.39 % (622804)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4127654538:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.60/1.39 % (622805)lrs+10_1_sil=8000:sp=occurrence:random_seed=4258821677:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.60/1.39 % (622802)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=978052886:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.60/1.39 % (622806)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3747760729:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.60/1.39 % (622803)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1094981488:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.60/1.39 % (622808)dis-21_1_sil=8000:lcm=predicate:random_seed=3777202194: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.60/1.39 % (622807)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3746114193:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.60/1.39 % (622805)First to succeed.
% 3.60/1.39 % (622805)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-622797"
% 3.60/1.39 % (622807)Also succeeded, but the first one will report.
% 3.60/1.39 % (622806)Also succeeded, but the first one will report.
% 3.60/1.39 % (622808)Instruction limit reached!
% 3.60/1.39 % (622808)------------------------------
% 3.60/1.39 % (622808)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.39 % (622808)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.39 % (622808)CaDiCaL version: 2.1.3
% 3.60/1.39 % (622808)Termination reason: Instruction limit
% 3.60/1.39 % (622808)Termination phase: Saturation
% 3.60/1.39 % (622808)Time elapsed: 0.071 s
% 3.60/1.39 % (622808)Peak memory usage: 88 MB
% 3.60/1.39 % (622808)Instructions burned: 118 (million)
% 3.60/1.39 % (622816)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=1436362136:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.60/1.39 % (622816)Refutation not found, incomplete strategy
% 3.60/1.39 % (622816)------------------------------
% 3.60/1.39 % (622816)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.39 % (622816)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.39 % (622816)CaDiCaL version: 2.1.3
% 3.60/1.39 % (622816)Termination reason: Refutation not found, incomplete strategy
% 3.60/1.39 % (622816)Time elapsed: 0.002 s
% 3.60/1.39 % (622816)Peak memory usage: 88 MB
% 3.60/1.39 % (622816)Instructions burned: 2 (million)
% 3.60/1.39 % (622805)Refutation found. Thanks to Tanya!
% 3.60/1.39 % SZS status Unsatisfiable for theBenchmark
% 3.60/1.39 % SZS output start Proof for theBenchmark
% See solution above
% 3.60/1.39 % (622805)------------------------------
% 3.60/1.39 % (622805)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.60/1.39 % (622805)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.60/1.39 % (622805)CaDiCaL version: 2.1.3
% 3.60/1.39 % (622805)Termination reason: Refutation
% 3.60/1.39 % (622805)Time elapsed: 0.007 s
% 3.60/1.39 % (622805)Peak memory usage: 89 MB
% 3.60/1.39 % (622805)Instructions burned: 7 (million)
% 3.60/1.39 % (622805)------------------------------
% 3.60/1.39 % (622805)------------------------------
% 3.60/1.39 % (622797)Success in time 0.444 s
% 3.60/1.39 % Vampire exiting
%------------------------------------------------------------------------------