%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/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 09:47:04 AM UTC 2026
% Result : Theorem 2.83s 1.14s
% Output : Refutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 63 ( 24 unt; 0 typ; 15 def)
% Number of atoms : 126 ( 70 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 105 ( 42 ~; 48 |; 3 &)
% ( 10 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 150 ( 0 atm; 0 fun; 125 num; 25 var)
% Number of types : 2 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 11 prp; 0-2 aty)
% Number of functors : 16 ( 9 usr; 14 con; 0-3 aty)
% Number of variables : 41 ( 37 !; 4 ?; 41 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
array: $tType ).
tff(func_def_0,type,
read: ( array * $int ) > $int ).
tff(func_def_1,type,
write: ( array * $int * $int ) > array ).
tff(func_def_9,type,
sK0: array ).
tff(func_def_10,type,
sK1: array ).
tff(func_def_11,type,
sF2: $int ).
tff(func_def_12,type,
sF3: array ).
tff(func_def_13,type,
sF4: array ).
tff(func_def_14,type,
sF5: array ).
tff(func_def_15,type,
sF6: array ).
tff(f1,axiom,
! [X2: $int,X1: $int,X0: array] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f2,axiom,
! [X1: $int,X3: $int,X2: $int,X0: array] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f3,conjecture,
! [X0: array,X1: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ( read(X0,3) = 33 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f4,negated_conjecture,
~ ! [X0: array,X1: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ( read(X0,3) = 33 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
! [X2: array,X0: $int,X1: $int] : ( read(write(X2,X1,X0),X1) = X0 ),
inference(rectify,[],[f1]) ).
tff(f6,plain,
! [X2: $int,X0: $int,X1: $int,X3: array] :
( ( read(write(X3,X0,X1),X2) = read(X3,X2) )
| ( X0 = X2 ) ),
inference(rectify,[],[f2]) ).
tff(f7,plain,
? [X1: array,X0: array] :
( ( 33 != read(X0,3) )
& ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f8,plain,
! [X0: $int,X1: $int,X2: $int,X3: array] :
( ( read(X3,X0) = read(write(X3,X1,X2),X0) )
| ( X0 = X1 ) ),
inference(rectify,[],[f6]) ).
tff(f9,plain,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X2,X1),X2) = X1 ),
inference(rectify,[],[f5]) ).
tff(f10,plain,
? [X0: array,X1: array] :
( ( 33 != read(X1,3) )
& ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 ) ),
inference(rectify,[],[f7]) ).
tff(f11,plain,
( ( 33 != read(sK1,3) )
& ( sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f10]) ).
tff(f12,plain,
! [X2: $int,X3: array,X0: $int,X1: $int] :
( ( read(X3,X0) = read(write(X3,X1,X2),X0) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f8]) ).
tff(f13,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X2,X1),X2) = X1 ),
inference(cnf_transformation,[],[f9]) ).
tff(f14,plain,
sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f11]) ).
tff(f15,plain,
33 != read(sK1,3),
inference(cnf_transformation,[],[f11]) ).
tff(f16,definition,
sF2 = read(sK1,3),
introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).
tff(f17,plain,
read(sK1,3) = sF2,
inference(reorient_equations,[],[f16]) ).
tff(f18,plain,
33 != sF2,
inference(definition_folding,[],[f15,f17]) ).
tff(f19,definition,
sF3 = write(sK0,3,33),
introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).
tff(f20,definition,
sF4 = write(sF3,4,444),
introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).
tff(f21,plain,
write(sF3,4,444) = sF4,
inference(reorient_equations,[],[f20]) ).
tff(f22,definition,
sF5 = write(sF4,5,55),
introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).
tff(f23,plain,
write(sF4,5,55) = sF5,
inference(reorient_equations,[],[f22]) ).
tff(f24,definition,
sF6 = write(sF5,4,44),
introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).
tff(f25,plain,
sF6 = sK1,
inference(definition_folding,[],[f14,f24,f23,f21,f19]) ).
tff(f27,definition,
( spl7_1
<=> ( sF6 = sK1 ) ),
introduced(definition,[new_symbols(definition,[spl7_1])],[avatar_definition]) ).
tff(f29,plain,
( ( sF6 = sK1 )
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f27]) ).
tff(f30,plain,
spl7_1,
inference(avatar_split_clause,[],[f25,f27]) ).
tff(f32,definition,
( spl7_2
<=> ( read(sK1,3) = sF2 ) ),
introduced(definition,[new_symbols(definition,[spl7_2])],[avatar_definition]) ).
tff(f35,plain,
spl7_2,
inference(avatar_split_clause,[],[f17,f32]) ).
tff(f37,definition,
( spl7_3
<=> ( write(sF4,5,55) = sF5 ) ),
introduced(definition,[new_symbols(definition,[spl7_3])],[avatar_definition]) ).
tff(f39,plain,
( ( write(sF4,5,55) = sF5 )
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f37]) ).
tff(f40,plain,
spl7_3,
inference(avatar_split_clause,[],[f23,f37]) ).
tff(f42,definition,
( spl7_4
<=> ( sF3 = write(sK0,3,33) ) ),
introduced(definition,[new_symbols(definition,[spl7_4])],[avatar_definition]) ).
tff(f44,plain,
( ( sF3 = write(sK0,3,33) )
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f42]) ).
tff(f45,plain,
spl7_4,
inference(avatar_split_clause,[],[f19,f42]) ).
tff(f47,definition,
( spl7_5
<=> ( 33 = sF2 ) ),
introduced(definition,[new_symbols(definition,[spl7_5])],[avatar_definition]) ).
tff(f50,plain,
~ spl7_5,
inference(avatar_split_clause,[],[f18,f47]) ).
tff(f52,definition,
( spl7_6
<=> ( write(sF3,4,444) = sF4 ) ),
introduced(definition,[new_symbols(definition,[spl7_6])],[avatar_definition]) ).
tff(f54,plain,
( ( write(sF3,4,444) = sF4 )
| ~ spl7_6 ),
inference(avatar_component_clause,[],[f52]) ).
tff(f55,plain,
spl7_6,
inference(avatar_split_clause,[],[f21,f52]) ).
tff(f57,definition,
( spl7_7
<=> ( sF6 = write(sF5,4,44) ) ),
introduced(definition,[new_symbols(definition,[spl7_7])],[avatar_definition]) ).
tff(f59,plain,
( ( sF6 = write(sF5,4,44) )
| ~ spl7_7 ),
inference(avatar_component_clause,[],[f57]) ).
tff(f60,plain,
spl7_7,
inference(avatar_split_clause,[],[f24,f57]) ).
tff(f61,plain,
( ( 33 = read(sF3,3) )
| ~ spl7_4 ),
inference(superposition,[],[f13,f44]) ).
tff(f66,definition,
( spl7_8
<=> ( 33 = read(sF3,3) ) ),
introduced(definition,[new_symbols(definition,[spl7_8])],[avatar_definition]) ).
tff(f68,plain,
( ( 33 = read(sF3,3) )
| ~ spl7_8 ),
inference(avatar_component_clause,[],[f66]) ).
tff(f69,plain,
( spl7_8
| ~ spl7_4 ),
inference(avatar_split_clause,[],[f61,f42,f66]) ).
tff(f87,plain,
( ! [X0: $int] :
( ( read(sF3,X0) = read(sF4,X0) )
| ( 4 = X0 ) )
| ~ spl7_6 ),
inference(superposition,[],[f12,f54]) ).
tff(f88,plain,
( ! [X0: $int] :
( ( read(sF4,X0) = read(sF5,X0) )
| ( 5 = X0 ) )
| ~ spl7_3 ),
inference(superposition,[],[f12,f39]) ).
tff(f89,plain,
( ! [X0: $int] :
( ( 4 = X0 )
| ( read(sF6,X0) = read(sF5,X0) ) )
| ~ spl7_7 ),
inference(superposition,[],[f12,f59]) ).
tff(f90,plain,
( ! [X0: $int] :
( ( read(sK1,X0) = read(sF5,X0) )
| ( 4 = X0 ) )
| ~ spl7_1
| ~ spl7_7 ),
inference(forward_demodulation,[],[f89,f29]) ).
tff(f101,plain,
( ( 33 = read(sF4,3) )
| ( 3 = 4 )
| ~ spl7_6
| ~ spl7_8 ),
inference(superposition,[],[f68,f87]) ).
tff(f102,plain,
( ( 33 = read(sF4,3) )
| ~ spl7_6
| ~ spl7_8 ),
inference(evaluation,[],[f101]) ).
tff(f105,definition,
( spl7_13
<=> ( 33 = read(sF4,3) ) ),
introduced(definition,[new_symbols(definition,[spl7_13])],[avatar_definition]) ).
tff(f107,plain,
( ( 33 = read(sF4,3) )
| ~ spl7_13 ),
inference(avatar_component_clause,[],[f105]) ).
tff(f108,plain,
( spl7_13
| ~ spl7_6
| ~ spl7_8 ),
inference(avatar_split_clause,[],[f102,f66,f52,f105]) ).
tff(f109,plain,
( ! [X0: $int] :
( ( read(sK1,X0) = read(sF4,X0) )
| ( 4 = X0 )
| ( 5 = X0 ) )
| ~ spl7_1
| ~ spl7_3
| ~ spl7_7 ),
inference(superposition,[],[f88,f90]) ).
tff(f111,plain,
( ( 33 = read(sK1,3) )
| ( 3 = 5 )
| ( 3 = 4 )
| ~ spl7_1
| ~ spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(superposition,[],[f107,f109]) ).
tff(f113,plain,
( ( 33 = read(sK1,3) )
| ~ spl7_1
| ~ spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(evaluation,[],[f111]) ).
tff(f116,definition,
( spl7_14
<=> ( 33 = read(sK1,3) ) ),
introduced(definition,[new_symbols(definition,[spl7_14])],[avatar_definition]) ).
tff(f119,plain,
( spl7_14
| ~ spl7_1
| ~ spl7_3
| ~ spl7_7
| ~ spl7_13 ),
inference(avatar_split_clause,[],[f113,f105,f57,f37,f27,f116]) ).
tff(f120,plain,
$false,
inference(avatar_smt_refutation,[],[f119,f108,f69,f60,f55,f50,f45,f40,f35,f30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT003_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.18 % Computer : n016.cluster.edu
% 0.11/0.18 % Model : x86_64 x86_64
% 0.11/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18 % Memory : 8046.5625MB
% 0.11/0.18 % OS : Linux 6.8.0-71-generic
% 0.11/0.18 % CPULimit : 300
% 0.11/0.18 % WCLimit : 300
% 0.11/0.18 % DateTime : Tue Sep 29 00:09:49 UTC 2026
% 0.11/0.18 % CPUTime :
% 0.11/0.18 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.22 Running first-order theorem proving
% 0.11/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.83/1.14 % (4165691)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 2.83/1.14 % (4165840)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=482501046:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 2.83/1.14 % (4165840)First to succeed.
% 2.83/1.14 % (4165840)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4165691"
% 2.83/1.14 % (4165835)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=2496005275:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 2.83/1.14 % (4165837)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=1390793892:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 2.83/1.14 % (4165834)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=2295705474:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 2.83/1.14 % (4165831)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1198555719:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 2.83/1.14 % (4165832)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1297211630:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 2.83/1.14 % (4165837)Also succeeded, but the first one will report.
% 2.83/1.14 % (4165835)Also succeeded, but the first one will report.
% 2.83/1.14 % (4165838)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=1376748637:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 2.83/1.14 % (4165834)Also succeeded, but the first one will report.
% 2.83/1.14 % (4165831)Refutation not found, incomplete strategy
% 2.83/1.14 % (4165831)------------------------------
% 2.83/1.14 % (4165831)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.83/1.14 % (4165831)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.83/1.14 % (4165831)CaDiCaL version: 2.1.3
% 2.83/1.14 % (4165831)Termination reason: Refutation not found, incomplete strategy
% 2.83/1.14 % (4165831)Time elapsed: 0.029 s
% 2.83/1.14 % (4165831)Peak memory usage: 115 MB
% 2.83/1.14 % (4165831)Instructions burned: 7 (million)
% 2.83/1.14 % (4165832)Also succeeded, but the first one will report.
% 2.83/1.14 % (4165838)Also succeeded, but the first one will report.
% 2.83/1.14 % (4165840)Refutation found. Thanks to Tanya!
% 2.83/1.14 % SZS status Theorem for theBenchmark
% 2.83/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 2.83/1.14 % (4165840)------------------------------
% 2.83/1.14 % (4165840)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.83/1.14 % (4165840)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.83/1.14 % (4165840)CaDiCaL version: 2.1.3
% 2.83/1.14 % (4165840)Termination reason: Refutation
% 2.83/1.14 % (4165840)Time elapsed: 0.025 s
% 2.83/1.14 % (4165840)Peak memory usage: 116 MB
% 2.83/1.14 % (4165840)Instructions burned: 18 (million)
% 2.83/1.14 % (4165840)------------------------------
% 2.83/1.14 % (4165840)------------------------------
% 2.83/1.14 % (4165691)Success in time 0.296 s
% 2.83/1.14 % Vampire exiting
%------------------------------------------------------------------------------