%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : DAT006_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 : n017.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:05 AM UTC 2026
% Result : Theorem 0.22s 1.14s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 5 ~; 14 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 112 ( 0 atm; 0 fun; 84 num; 28 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 : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 4 usr; 9 con; 0-3 aty)
% Number of variables : 43 ( 38 !; 5 ?; 43 :)
% 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(f1,axiom,
! [X1: $int,X0: array,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f2,axiom,
! [X1: $int,X2: $int,X0: array,X3: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f3,conjecture,
! [X1: array,X0: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ? [X2: $int] : ( read(X0,X2) = 33 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f4,negated_conjecture,
~ ! [X1: array,X0: array] :
( ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) )
=> ? [X2: $int] : ( read(X0,X2) = 33 ) ),
inference(negated_conjecture,[status(cth)],[f3]) ).
tff(f5,plain,
! [X0: $int,X3: $int,X2: array,X1: $int] :
( ( X0 = X1 )
| ( read(write(X2,X0,X3),X1) = read(X2,X1) ) ),
inference(rectify,[],[f2]) ).
tff(f6,plain,
~ ! [X0: array,X1: array] :
( ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 )
=> ? [X2: $int] : ( 33 = read(X1,X2) ) ),
inference(rectify,[],[f4]) ).
tff(f7,plain,
? [X0: array,X1: array] :
( ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 )
& ! [X2: $int] : ( 33 != read(X1,X2) ) ),
inference(ennf_transformation,[],[f6]) ).
tff(f8,plain,
! [X0: $int,X1: array,X2: $int] : ( read(write(X1,X0,X2),X0) = X2 ),
inference(rectify,[],[f1]) ).
tff(f9,plain,
! [X0: $int,X1: $int,X2: array,X3: $int] :
( ( X0 = X3 )
| ( read(write(X2,X0,X1),X3) = read(X2,X3) ) ),
inference(rectify,[],[f5]) ).
tff(f10,plain,
( ( sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44) )
& ! [X2: $int] : ( 33 != read(sK1,X2) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f7]) ).
tff(f11,plain,
! [X2: $int,X0: $int,X1: array] : ( read(write(X1,X0,X2),X0) = X2 ),
inference(cnf_transformation,[],[f8]) ).
tff(f12,plain,
! [X2: array,X3: $int,X0: $int,X1: $int] :
( ( read(write(X2,X0,X1),X3) = read(X2,X3) )
| ( X0 = X3 ) ),
inference(cnf_transformation,[],[f9]) ).
tff(f13,plain,
! [X2: $int] : ( 33 != read(sK1,X2) ),
inference(cnf_transformation,[],[f10]) ).
tff(f14,plain,
sK1 = write(write(write(write(sK0,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f10]) ).
tff(f17,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(write(write(sK0,3,33),4,444),5,55),X0) )
| ( 4 = X0 ) ),
inference(constrained_superposition,[],[f12,f14]) ).
tff(f19,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(write(sK0,3,33),4,444),X0) )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(constrained_superposition,[],[f17,f12]) ).
tff(f25,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(sK0,3,33),X0) )
| ( 5 = X0 )
| ( 4 = X0 )
| ( 4 = X0 ) ),
inference(constrained_superposition,[],[f19,f12]) ).
tff(f27,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(sK0,3,33),X0) )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(duplicate_literal_removal,[],[f25]) ).
tff(f29,plain,
( ( 3 = 4 )
| ( 33 = read(sK1,3) )
| ( 3 = 5 ) ),
inference(constrained_superposition,[],[f27,f11]) ).
tff(f33,plain,
33 = read(sK1,3),
inference(evaluation,[],[f29]) ).
tff(f35,plain,
$false,
inference(forward_subsumption_resolution,[],[f33,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT006_1 : TPTP v9.3.1. Released v5.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19 % Computer : n017.cluster.edu
% 0.10/0.19 % Model : x86_64 x86_64
% 0.10/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19 % Memory : 8046.5625MB
% 0.10/0.19 % OS : Linux 6.8.0-71-generic
% 0.10/0.19 % CPULimit : 300
% 0.10/0.19 % WCLimit : 300
% 0.10/0.19 % DateTime : Tue Sep 29 00:00:37 UTC 2026
% 0.10/0.19 % CPUTime :
% 0.10/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23 Running first-order theorem proving
% 0.10/0.23 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
% 0.22/1.14 % (4145207)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 0.22/1.14 % (4145216)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=2170427483:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 0.22/1.14 % (4145216)First to succeed.
% 0.22/1.14 % (4145216)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4145207"
% 0.22/1.14 % (4145217)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=1976087749:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 0.22/1.14 % (4145218)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=529010808:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 0.22/1.14 % (4145215)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=440046429:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 0.22/1.14 % (4145213)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=763706418:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 0.22/1.14 % (4145214)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=3934033850:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 0.22/1.14 % (4145212)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=527368868:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 0.22/1.14 % (4145215)Also succeeded, but the first one will report.
% 0.22/1.14 % (4145212)Refutation not found, incomplete strategy
% 0.22/1.14 % (4145212)------------------------------
% 0.22/1.14 % (4145212)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.14 % (4145212)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.14 % (4145212)CaDiCaL version: 2.1.3
% 0.22/1.14 % (4145212)Termination reason: Refutation not found, incomplete strategy
% 0.22/1.14 % (4145212)Time elapsed: 0.029 s
% 0.22/1.14 % (4145212)Peak memory usage: 115 MB
% 0.22/1.14 % (4145212)Instructions burned: 7 (million)
% 0.22/1.14 % (4145214)Also succeeded, but the first one will report.
% 0.22/1.14 % (4145217)Also succeeded, but the first one will report.
% 0.22/1.14 % (4145213)Also succeeded, but the first one will report.
% 0.22/1.14 % (4145218)Also succeeded, but the first one will report.
% 0.22/1.14 % (4145216)Refutation found. Thanks to Tanya!
% 0.22/1.14 % SZS status Theorem for theBenchmark
% 0.22/1.14 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/1.14 % (4145216)------------------------------
% 0.22/1.14 % (4145216)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.14 % (4145216)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.14 % (4145216)CaDiCaL version: 2.1.3
% 0.22/1.14 % (4145216)Termination reason: Refutation
% 0.22/1.14 % (4145216)Time elapsed: 0.002 s
% 0.22/1.14 % (4145216)Peak memory usage: 89 MB
% 0.22/1.14 % (4145216)Instructions burned: 3 (million)
% 0.22/1.14 % (4145216)------------------------------
% 0.22/1.14 % (4145216)------------------------------
% 0.22/1.14 % (4145207)Success in time 0.278 s
% 0.22/1.14 % Vampire exiting
%------------------------------------------------------------------------------