%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : HWV022-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 : n007.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:15 AM UTC 2026
% Result : Unsatisfiable 0.16s 1.50s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of formulae : 70 ( 27 unt; 4 def)
% Number of atoms : 128 ( 33 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 118 ( 60 ~; 54 |; 0 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : plus(X0,n1) != n0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1) ).
fof(f2,axiom,
! [X0] : gt(plus(X0,n1),n0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).
fof(f3,axiom,
! [X0] :
( gt(X0,minus(X0,n1))
| ~ gt(X0,n0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
fof(f5,axiom,
! [X2,X0,X1] :
( minus(X0,X1) = X2
| plus(X2,X1) != X0
| def_10(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).
fof(f6,axiom,
! [X0,X1] :
( ~ def_10(X0,X1)
| ~ gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).
fof(f7,axiom,
! [X0,X1] :
( ~ def_10(X0,X1)
| X1 != X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
fof(f8,plain,
! [X0,X1] :
( ~ def_10(X0,X1)
| X0 != X1 ),
inference(reorient_equations,[],[f7]) ).
fof(f11,axiom,
! [X0,X1] :
( gt(X0,X1)
| ~ gt(plus(X0,n1),X1)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).
fof(f12,plain,
! [X0,X1] :
( gt(X0,X1)
| ~ gt(plus(X0,n1),X1)
| X0 = X1 ),
inference(reorient_equations,[],[f11]) ).
fof(f14,axiom,
! [X0,X1] :
( gt(X0,X1)
| X1 = X0
| gt(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_12) ).
fof(f15,plain,
! [X0,X1] :
( gt(X0,X1)
| X0 = X1
| gt(X1,X0) ),
inference(reorient_equations,[],[f14]) ).
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(f22,axiom,
! [X0] : ~ gt(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_17) ).
fof(f24,axiom,
! [X0] : plus(n0,X0) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_19) ).
fof(f26,axiom,
! [X0] : level(X0) = int_level(X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_21) ).
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(f113,negated_conjecture,
plus(level(t_139),n1) = fifo_length,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).
fof(f114,plain,
fifo_length = plus(level(t_139),n1),
inference(reorient_equations,[],[f113]) ).
fof(f115,negated_conjecture,
~ p_Rd(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).
fof(f116,negated_conjecture,
p_Wr(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).
fof(f117,negated_conjecture,
~ p_Reset(t_139),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).
fof(f118,negated_conjecture,
level(plus(t_139,n1)) != fifo_length,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).
fof(f119,plain,
fifo_length != level(plus(t_139,n1)),
inference(reorient_equations,[],[f118]) ).
fof(f121,plain,
! [X2,X1] :
( def_10(X1,plus(X2,X1))
| minus(plus(X2,X1),X1) = X2 ),
inference(equality_resolution,[],[f5]) ).
fof(f122,plain,
! [X1] : ~ def_10(X1,X1),
inference(equality_resolution,[],[f8]) ).
fof(f123,plain,
n0 != fifo_length,
inference(superposition,[],[f1,f114]) ).
fof(f125,plain,
fifo_length = plus(int_level(t_139),n1),
inference(superposition,[],[f114,f26]) ).
fof(f126,plain,
fifo_length != int_level(plus(t_139,n1)),
inference(superposition,[],[f119,f26]) ).
fof(f129,plain,
gt(fifo_length,n0),
inference(superposition,[],[f2,f114]) ).
fof(f155,definition,
( spl0_2
<=> n1 = fifo_length ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f156,plain,
( n1 = fifo_length
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f155]) ).
fof(f180,plain,
! [X0,X1] :
( ~ gt(X0,X1)
| ~ gt(X1,X0) ),
inference(resolution,[],[f16,f22]) ).
fof(f186,plain,
~ gt(n0,fifo_length),
inference(resolution,[],[f180,f129]) ).
fof(f195,plain,
( ~ gt(plus(n0,n1),fifo_length)
| n0 = fifo_length ),
inference(resolution,[],[f186,f12]) ).
fof(f197,plain,
~ gt(plus(n0,n1),fifo_length),
inference(forward_subsumption_resolution,[],[f195,f123]) ).
fof(f198,plain,
~ gt(n1,fifo_length),
inference(forward_demodulation,[],[f197,f24]) ).
fof(f203,plain,
( n1 = fifo_length
| gt(fifo_length,n1) ),
inference(resolution,[],[f198,f15]) ).
fof(f230,plain,
( def_10(n1,fifo_length)
| minus(fifo_length,n1) = level(t_139) ),
inference(superposition,[],[f121,f114]) ).
fof(f233,definition,
( spl0_5
<=> minus(fifo_length,n1) = int_level(t_139) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f235,plain,
( minus(fifo_length,n1) = int_level(t_139)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f233]) ).
fof(f237,definition,
( spl0_6
<=> def_10(n1,fifo_length) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f239,plain,
( def_10(n1,fifo_length)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f241,plain,
( minus(fifo_length,n1) = int_level(t_139)
| def_10(n1,fifo_length) ),
inference(forward_demodulation,[],[f230,f26]) ).
fof(f243,plain,
( spl0_6
| spl0_5 ),
inference(avatar_split_clause,[],[f241,f233,f237]) ).
fof(f294,plain,
( gt(fifo_length,int_level(t_139))
| ~ gt(fifo_length,n0)
| ~ spl0_5 ),
inference(superposition,[],[f3,f235]) ).
fof(f295,plain,
( gt(fifo_length,int_level(t_139))
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f294,f129]) ).
fof(f391,definition,
( spl0_20
<=> gt(fifo_length,n1) ),
introduced(definition,[new_symbols(definition,[spl0_20])],[avatar_definition]) ).
fof(f394,plain,
( spl0_20
| spl0_2 ),
inference(avatar_split_clause,[],[f203,f155,f391]) ).
fof(f585,plain,
( ~ gt(fifo_length,n1)
| ~ spl0_6 ),
inference(resolution,[],[f239,f6]) ).
fof(f588,plain,
( ~ spl0_20
| ~ spl0_6 ),
inference(avatar_split_clause,[],[f585,f237,f391]) ).
fof(f603,plain,
( def_10(n1,n1)
| ~ spl0_2
| ~ spl0_6 ),
inference(superposition,[],[f239,f156]) ).
fof(f612,plain,
( $false
| ~ spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f603,f122]) ).
fof(f613,plain,
( ~ spl0_2
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f612]) ).
fof(f680,plain,
( ~ p_Wr(t_139)
| p_Reset(t_139)
| ~ gt(fifo_length,int_level(t_139))
| plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
inference(resolution,[],[f45,f115]) ).
fof(f690,plain,
( p_Reset(t_139)
| ~ gt(fifo_length,int_level(t_139))
| plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
inference(forward_subsumption_resolution,[],[f680,f116]) ).
fof(f691,plain,
( ~ gt(fifo_length,int_level(t_139))
| plus(int_level(t_139),n1) = int_level(plus(t_139,n1)) ),
inference(forward_subsumption_resolution,[],[f690,f117]) ).
fof(f692,plain,
( plus(int_level(t_139),n1) = int_level(plus(t_139,n1))
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f691,f295]) ).
fof(f693,plain,
( fifo_length = int_level(plus(t_139,n1))
| ~ spl0_5 ),
inference(forward_demodulation,[],[f692,f125]) ).
fof(f694,plain,
( $false
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[],[f693,f126]) ).
fof(f695,plain,
~ spl0_5,
inference(avatar_contradiction_clause,[],[f694]) ).
cnf(s6,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f243]) ).
cnf(s18,plain,
( spl0_2
| spl0_20 ),
inference(sat_conversion,[],[f394]) ).
cnf(s41,plain,
( ~ spl0_6
| ~ spl0_20 ),
inference(sat_conversion,[],[f588]) ).
cnf(s42,plain,
( ~ spl0_2
| ~ spl0_6 ),
inference(sat_conversion,[],[f613]) ).
cnf(s51,plain,
~ spl0_5,
inference(sat_conversion,[],[f695]) ).
cnf(s52,plain,
spl0_6,
inference(rat,[],[s6,s51]) ).
cnf(s53,plain,
~ spl0_2,
inference(rat,[],[s42,s52]) ).
cnf(s54,plain,
~ spl0_20,
inference(rat,[],[s41,s52]) ).
cnf(s57,plain,
$false,
inference(rat,[],[s18,s54,s53]) ).
fof(f696,plain,
$false,
inference(avatar_sat_refutation,[],[s57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV022-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.09/0.38 % Computer : n007.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 27 10:55:54 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.42 Running first-order theorem proving
% 0.09/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
% 0.16/1.50 % (1239143)Input is clausal, will run a generic CNF schedule.
% 0.16/1.50 % (1239251)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2077319124:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.16/1.50 % (1239254)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=166926819:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.16/1.50 % (1239253)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1493275238:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.16/1.50 % (1239250)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2754334478:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.16/1.50 % (1239255)dis-21_1_sil=8000:lcm=predicate:random_seed=3395524992: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)
% 0.16/1.50 % (1239249)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=4270726048:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.16/1.50 % (1239254)First to succeed.
% 0.16/1.50 % (1239254)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1239143"
% 0.16/1.50 % (1239252)lrs+10_1_sil=8000:sp=occurrence:random_seed=1352187052:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.16/1.50 % (1239255)Instruction limit reached!
% 0.16/1.50 % (1239255)------------------------------
% 0.16/1.50 % (1239255)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1239255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1239255)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1239255)Termination reason: Instruction limit
% 0.16/1.50 % (1239255)Termination phase: Saturation
% 0.16/1.50 % (1239255)Time elapsed: 0.069 s
% 0.16/1.50 % (1239255)Peak memory usage: 88 MB
% 0.16/1.50 % (1239255)Instructions burned: 117 (million)
% 0.16/1.50 % (1239253)Instruction limit reached!
% 0.16/1.50 % (1239253)------------------------------
% 0.16/1.50 % (1239253)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1239253)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1239253)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1239253)Termination reason: Instruction limit
% 0.16/1.50 % (1239253)Termination phase: Saturation
% 0.16/1.50 % (1239253)Time elapsed: 0.078 s
% 0.16/1.50 % (1239253)Peak memory usage: 88 MB
% 0.16/1.50 % (1239253)Instructions burned: 114 (million)
% 0.16/1.50 % (1239252)Instruction limit reached!
% 0.16/1.50 % (1239252)------------------------------
% 0.16/1.50 % (1239252)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1239252)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1239252)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1239252)Termination reason: Instruction limit
% 0.16/1.50 % (1239252)Termination phase: Saturation
% 0.16/1.50 % (1239252)Time elapsed: 0.091 s
% 0.16/1.50 % (1239252)Peak memory usage: 89 MB
% 0.16/1.50 % (1239252)Instructions burned: 107 (million)
% 0.16/1.50 % (1239272)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=29584341:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 0.16/1.50 % (1239277)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=4149040266: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)
% 0.16/1.50 % (1239254)Refutation found. Thanks to Tanya!
% 0.16/1.50 % SZS status Unsatisfiable for theBenchmark
% 0.16/1.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.50 % (1239254)------------------------------
% 0.16/1.50 % (1239254)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.50 % (1239254)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.50 % (1239254)CaDiCaL version: 2.1.3
% 0.16/1.50 % (1239254)Termination reason: Refutation
% 0.16/1.50 % (1239254)Time elapsed: 0.020 s
% 0.16/1.50 % (1239254)Peak memory usage: 89 MB
% 0.16/1.50 % (1239254)Instructions burned: 25 (million)
% 0.16/1.50 % (1239254)------------------------------
% 0.16/1.50 % (1239254)------------------------------
% 0.16/1.50 % (1239143)Success in time 0.438 s
% 0.16/1.50 % Vampire exiting
%------------------------------------------------------------------------------