%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : DAT076_1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:48:05 AM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 21 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 62 ( 21 ~; 11 |; 21 &)
% ( 2 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 81 ( 38 atm; 0 fun; 18 num; 25 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 10 usr; 1 con; 0-3 aty)
% Number of variables : 45 ( 41 !; 4 ?; 45 :)
% 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_2,type,
init: $int > array ).
tff(func_def_3,type,
max: ( array * $int ) > $int ).
tff(func_def_5,type,
rev: ( array * $int ) > array ).
tff(func_def_10,type,
sK0: ( array * array ) > $int ).
tff(func_def_11,type,
sK1: ( array * $int * $int ) > $int ).
tff(func_def_12,type,
sK2: ( array * $int ) > $int ).
tff(func_def_13,type,
sK3: ( array * $int ) > $int ).
tff(func_def_14,type,
sK4: ( array * array * $int ) > $int ).
tff(pred_def_4,type,
sorted: ( array * $int ) > $o ).
tff(pred_def_6,type,
inRange: ( array * $int * $int ) > $o ).
tff(pred_def_7,type,
distinct: ( array * $int ) > $o ).
tff(f6,axiom,
! [X0: array,X1: $int] :
( sorted(X0,X1)
<=> ! [X2: $int,X3: $int] :
( ( $lesseq(0,X2)
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1) )
=> $lesseq(read(X0,X2),read(X0,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sorted1) ).
tff(f10,conjecture,
~ ! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c4) ).
tff(f11,negated_conjecture,
~ ~ ! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
inference(negated_conjecture,[status(cth)],[f10]) ).
tff(f13,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
<=> ! [X2: $int,X3: $int] :
( ( ~ $less(X2,0)
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1) )
=> ~ $less(read(X0,X3),read(X0,X2)) ) ),
inference(theory_normalization,[],[f6]) ).
tff(f30,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
inference(flattening,[],[f11]) ).
tff(f31,plain,
! [X0: array,X1: $int] :
( ! [X2: $int,X3: $int] :
( ( ~ $less(X2,0)
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1) )
=> ~ $less(read(X0,X3),read(X0,X2)) )
=> sorted(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f13]) ).
tff(f35,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& ~ $less(X2,0)
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1) ) ),
inference(ennf_transformation,[],[f31]) ).
tff(f36,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& ~ $less(X2,0)
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1) ) ),
inference(flattening,[],[f35]) ).
tff(f38,plain,
! [X0: array,X1: $int] :
( ~ sorted(rev(X0,X1),X1)
| ~ sorted(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
tff(f41,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ( $less(read(X0,sK3(X0,X1)),read(X0,sK2(X0,X1)))
& ~ $less(sK2(X0,X1),0)
& $less(sK2(X0,X1),X1)
& $less(sK2(X0,X1),sK3(X0,X1))
& $less(sK3(X0,X1),X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3]),skolemize(X2,sK2(X0,X1)),skolemize(X3,sK3(X0,X1))],[f36]) ).
tff(f52,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| $less(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f41]) ).
tff(f53,plain,
! [X0: array,X1: $int] :
( ~ $less(sK2(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tff(f58,plain,
! [X0: array,X1: $int] :
( ~ sorted(rev(X0,X1),X1)
| ~ sorted(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
tff(f89,plain,
! [X0: array,X1: $int] :
( ~ sorted(X0,X1)
| $less(sK2(rev(X0,X1),X1),X1) ),
inference(resolution,[],[f52,f58]) ).
tff(f91,plain,
! [X0: array,X1: $int] :
( $less(sK2(rev(X0,X1),X1),X1)
| $less(sK2(X0,X1),X1) ),
inference(resolution,[],[f89,f52]) ).
tff(f114,plain,
! [X0: array] :
( sorted(rev(X0,0),0)
| $less(sK2(X0,0),0) ),
inference(resolution,[],[f91,f53]) ).
tff(f127,plain,
! [X0: array] :
( $less(sK2(X0,0),0)
| ~ sorted(X0,0) ),
inference(resolution,[],[f114,f58]) ).
tff(f130,plain,
! [X0: array] : $less(sK2(X0,0),0),
inference(forward_subsumption_resolution,[],[f127,f52]) ).
tff(f143,plain,
! [X0: array] : sorted(X0,0),
inference(resolution,[],[f130,f53]) ).
tff(f152,plain,
! [X0: array] : ~ sorted(X0,0),
inference(resolution,[],[f143,f58]) ).
tff(f155,plain,
$false,
inference(forward_subsumption_resolution,[],[f152,f143]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : DAT076_1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n011.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:08:01 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 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.20/0.27 % (3915510)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (3915516)% WARNING: option uhcvi not known.
% 0.20/0.27 % (3915519)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1285982951:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (3915516)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2405724782:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (3915518)dis+10_1_sil=32000:sp=arity:random_seed=3755782037:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (3915517)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3289525532:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (3915515)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1294642836_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (3915520)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2628515257:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (3915521)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3035250512:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (3915515)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.27 % (3915515)Terminated due to inappropriate strategy.
% 0.20/0.27 % (3915515)------------------------------
% 0.20/0.27 % (3915515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3915515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3915515)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3915515)Termination reason: Inappropriate
% 0.20/0.27 % (3915515)Time elapsed: 0.001 s
% 0.20/0.27 % (3915515)Peak memory usage: 10 MB
% 0.20/0.27 % (3915515)Instructions burned: 1 (million)
% 0.20/0.27 % (3915515)------------------------------
% 0.20/0.27 % (3915515)------------------------------
% 0.20/0.27 % (3915520) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3915510-3915520"...
% 0.20/0.27 % (3915520)...printing done.
% 0.20/0.27 % (3915520)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (3915520)------------------------------
% 0.20/0.27 % (3915520)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (3915520)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (3915520)CaDiCaL version: 2.1.3
% 0.20/0.27 % (3915520)Termination reason: Refutation
% 0.20/0.27 % (3915520)Time elapsed: 0.003 s
% 0.20/0.27 % (3915520)Peak memory usage: 12 MB
% 0.20/0.27 % (3915520)Instructions burned: 6 (million)
% 0.20/0.27 % (3915510)Success in time 0.039 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------