%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT003_1 : TPTP v9.3.1. Released v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:56 AM UTC 2026
% Result : Theorem 0.08s 0.26s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 18 ( 3 ~; 12 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 84 ( 0 atm; 0 fun; 70 num; 14 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 : 24 ( 22 !; 2 ?; 24 :)
% 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,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax1) ).
tff(f2,axiom,
! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X1 = X2 )
| ( read(write(X0,X1,X3),X2) = read(X0,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',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/sandbox/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,
? [X0: array,X1: array] :
( ( 33 != read(X0,3) )
& ( X0 = write(write(write(write(X1,3,33),4,444),5,55),4,44) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f1]) ).
tff(f7,plain,
! [X2: $int,X3: $int,X0: array,X1: $int] :
( ( read(write(X0,X1,X3),X2) = read(X0,X2) )
| ( X1 = X2 ) ),
inference(cnf_transformation,[],[f2]) ).
tff(f8,plain,
sK0 = write(write(write(write(sK1,3,33),4,444),5,55),4,44),
inference(cnf_transformation,[],[f5]) ).
tff(f9,plain,
33 != read(sK0,3),
inference(cnf_transformation,[],[f5]) ).
tff(f11,plain,
! [X0: $int] :
( ( read(write(write(write(sK1,3,33),4,444),5,55),X0) = read(sK0,X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f7,f8]) ).
tff(f15,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(sK1,3,33),4,444),X0) )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(superposition,[],[f7,f11]) ).
tff(f19,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 )
| ( 4 = X0 ) ),
inference(superposition,[],[f7,f15]) ).
tff(f20,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(sK1,3,33),X0) )
| ( 4 = X0 )
| ( 5 = X0 ) ),
inference(duplicate_literal_removal,[],[f19]) ).
tff(f24,plain,
( ( 33 = read(sK0,3) )
| ( 3 = 4 )
| ( 3 = 5 ) ),
inference(superposition,[],[f6,f20]) ).
tff(f26,plain,
33 = read(sK0,3),
inference(evaluation,[],[f24]) ).
tff(f28,plain,
$false,
inference(forward_subsumption_resolution,[],[f26,f9]) ).
%------------------------------------------------------------------------------
%----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/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n016.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 00:09:49 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.26 % (4165637)Will run a generic schedule for satisfiability detection.
% 0.08/0.26 % (4165649)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1599996375:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26 % (4165649) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4165637-4165649"...
% 0.08/0.26 % (4165649)...printing done.
% 0.08/0.26 % (4165649)Refutation found. Thanks to Tanya!
% 0.08/0.26 % SZS status Theorem for theBenchmark
% 0.08/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26 % (4165649)------------------------------
% 0.08/0.26 % (4165649)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26 % (4165649)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26 % (4165649)CaDiCaL version: 2.1.3
% 0.08/0.26 % (4165649)Termination reason: Refutation
% 0.08/0.26 % (4165649)Time elapsed: 0.001 s
% 0.08/0.26 % (4165649)Peak memory usage: 12 MB
% 0.08/0.26 % (4165649)Instructions burned: 2 (million)
% 0.08/0.26 % (4165637)Success in time 0.029 s
% 0.08/0.26 % Vampire exiting
%------------------------------------------------------------------------------