TSTP Solution File: DAT071_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 05:05:55 EDT 2024
% Result : Theorem 0.15s 0.40s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 23
% Syntax : Number of formulae : 47 ( 11 unt; 18 typ; 0 def)
% Number of atoms : 161 ( 37 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 203 ( 71 ~; 33 |; 84 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 230 ( 123 atm; 0 fun; 46 num; 61 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 11 >; 14 *; 0 +; 0 <<)
% Number of predicates : 9 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 68 ( 38 !; 30 ?; 68 :)
% 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 ).
tff(func_def_11,type,
sK1: $int ).
tff(func_def_12,type,
sK2: $int ).
tff(func_def_13,type,
sK3: $int ).
tff(func_def_14,type,
sK4: $int ).
tff(func_def_15,type,
sK5: $int ).
tff(func_def_16,type,
sK6: ( array * array ) > $int ).
tff(func_def_17,type,
sK7: ( array * $int * $int ) > $int ).
tff(func_def_18,type,
sK8: ( 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(f284,plain,
$false,
inference(subsumption_resolution,[],[f283,f63]) ).
tff(f63,plain,
sK2 != sK3,
inference(cnf_transformation,[],[f48]) ).
tff(f48,plain,
( ( sK2 != sK3 )
& ( sK3 = read(sK0,sK4) )
& ~ $less(sK4,0)
& $less(sK4,sK1)
& ! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) )
& ( sK2 = read(sK0,sK5) )
& ~ $less(sK5,0)
& $less(sK5,sK1)
& ! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5])],[f40,f47,f46,f45]) ).
tff(f45,plain,
( ? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) )
=> ( ( sK2 != sK3 )
& ? [X4: $int] :
( ( sK3 = read(sK0,X4) )
& ~ $less(X4,0)
& $less(X4,sK1) )
& ! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) )
& ? [X6: $int] :
( ( sK2 = read(sK0,X6) )
& ~ $less(X6,0)
& $less(X6,sK1) )
& ! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ) ) ),
introduced(choice_axiom,[]) ).
tff(f46,plain,
( ? [X4: $int] :
( ( sK3 = read(sK0,X4) )
& ~ $less(X4,0)
& $less(X4,sK1) )
=> ( ( sK3 = read(sK0,sK4) )
& ~ $less(sK4,0)
& $less(sK4,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f47,plain,
( ? [X6: $int] :
( ( sK2 = read(sK0,X6) )
& ~ $less(X6,0)
& $less(X6,sK1) )
=> ( ( sK2 = read(sK0,sK5) )
& ~ $less(sK5,0)
& $less(sK5,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f40,plain,
? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) ),
inference(flattening,[],[f39]) ).
tff(f39,plain,
? [X0: array,X1: $int,X2: $int,X3: $int] :
( ( X2 != X3 )
& ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X3,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ~ $less(X2,read(X0,X7))
| $less(X7,0)
| ~ $less(X7,X1) ) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
~ ! [X0: array,X1: $int,X2: $int,X3: $int] :
( ( ? [X4: $int] :
( ( read(X0,X4) = X3 )
& ~ $less(X4,0)
& $less(X4,X1) )
& ! [X5: $int] :
( ( ~ $less(X5,0)
& $less(X5,X1) )
=> ~ $less(X3,read(X0,X5)) )
& ? [X6: $int] :
( ( read(X0,X6) = X2 )
& ~ $less(X6,0)
& $less(X6,X1) )
& ! [X7: $int] :
( ( ~ $less(X7,0)
& $less(X7,X1) )
=> ~ $less(X2,read(X0,X7)) ) )
=> ( X2 = X3 ) ),
inference(rectify,[],[f12]) ).
tff(f12,plain,
~ ! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& ~ $less(X1,0)
& $less(X1,X5) )
& ! [X1: $int] :
( ( ~ $less(X1,0)
& $less(X1,X5) )
=> ~ $less(X9,read(X0,X1)) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& ~ $less(X1,0)
& $less(X1,X5) )
& ! [X1: $int] :
( ( ~ $less(X1,0)
& $less(X1,X5) )
=> ~ $less(X8,read(X0,X1)) ) )
=> ( X8 = X9 ) ),
inference(theory_normalization,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
! [X0: array,X5: $int,X8: $int,X9: $int] :
( ( ? [X1: $int] :
( ( read(X0,X1) = X9 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( ( read(X0,X1) = X8 )
& $greatereq(X1,0)
& $greater(X5,X1) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f283,plain,
sK2 = sK3,
inference(subsumption_resolution,[],[f257,f131]) ).
tff(f131,plain,
~ $less(sK2,sK3),
inference(subsumption_resolution,[],[f130,f60]) ).
tff(f60,plain,
$less(sK4,sK1),
inference(cnf_transformation,[],[f48]) ).
tff(f130,plain,
( ~ $less(sK2,sK3)
| ~ $less(sK4,sK1) ),
inference(subsumption_resolution,[],[f129,f61]) ).
tff(f61,plain,
~ $less(sK4,0),
inference(cnf_transformation,[],[f48]) ).
tff(f129,plain,
( ~ $less(sK2,sK3)
| $less(sK4,0)
| ~ $less(sK4,sK1) ),
inference(superposition,[],[f55,f62]) ).
tff(f62,plain,
sK3 = read(sK0,sK4),
inference(cnf_transformation,[],[f48]) ).
tff(f55,plain,
! [X7: $int] :
( ~ $less(sK2,read(sK0,X7))
| $less(X7,0)
| ~ $less(X7,sK1) ),
inference(cnf_transformation,[],[f48]) ).
tff(f257,plain,
( $less(sK2,sK3)
| ( sK2 = sK3 ) ),
inference(resolution,[],[f25,f180]) ).
tff(f180,plain,
~ $less(sK3,sK2),
inference(subsumption_resolution,[],[f179,f56]) ).
tff(f56,plain,
$less(sK5,sK1),
inference(cnf_transformation,[],[f48]) ).
tff(f179,plain,
( ~ $less(sK3,sK2)
| ~ $less(sK5,sK1) ),
inference(subsumption_resolution,[],[f177,f57]) ).
tff(f57,plain,
~ $less(sK5,0),
inference(cnf_transformation,[],[f48]) ).
tff(f177,plain,
( ~ $less(sK3,sK2)
| $less(sK5,0)
| ~ $less(sK5,sK1) ),
inference(superposition,[],[f59,f58]) ).
tff(f58,plain,
sK2 = read(sK0,sK5),
inference(cnf_transformation,[],[f48]) ).
tff(f59,plain,
! [X5: $int] :
( ~ $less(sK3,read(sK0,X5))
| $less(X5,0)
| ~ $less(X5,sK1) ),
inference(cnf_transformation,[],[f48]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_144,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 12:48:33 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 % (16544)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37 % (16547)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37 % (16547)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.37 % (16547)Terminated due to inappropriate strategy.
% 0.15/0.37 % (16547)------------------------------
% 0.15/0.37 % (16547)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.37 % (16547)Termination reason: Inappropriate
% 0.15/0.37
% 0.15/0.37 % (16547)Memory used [KB]: 801
% 0.15/0.37 % (16547)Time elapsed: 0.003 s
% 0.15/0.37 % (16547)Instructions burned: 3 (million)
% 0.15/0.38 % (16547)------------------------------
% 0.15/0.38 % (16547)------------------------------
% 0.15/0.38 % (16552)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38 % (16548)WARNING: value z3 for option sas not known
% 0.15/0.38 % (16548)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38 % (16546)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38 % (16550)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38 % (16551)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38 % (16549)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39 % (16546)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (16546)Terminated due to inappropriate strategy.
% 0.15/0.39 % (16546)------------------------------
% 0.15/0.39 % (16546)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (16546)Termination reason: Inappropriate
% 0.15/0.39
% 0.15/0.39 % (16546)Memory used [KB]: 801
% 0.15/0.39 % (16546)Time elapsed: 0.005 s
% 0.15/0.39 % (16546)Instructions burned: 3 (million)
% 0.15/0.39 % (16546)------------------------------
% 0.15/0.39 % (16546)------------------------------
% 0.15/0.39 % (16549)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (16549)Terminated due to inappropriate strategy.
% 0.15/0.39 % (16549)------------------------------
% 0.15/0.39 % (16549)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (16549)Termination reason: Inappropriate
% 0.15/0.39
% 0.15/0.39 % (16549)Memory used [KB]: 801
% 0.15/0.39 % (16549)Time elapsed: 0.005 s
% 0.15/0.39 % (16549)Instructions burned: 3 (million)
% 0.15/0.39 % (16549)------------------------------
% 0.15/0.39 % (16549)------------------------------
% 0.15/0.39 % (16553)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.15/0.39 % (16553)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (16553)Terminated due to inappropriate strategy.
% 0.15/0.39 % (16553)------------------------------
% 0.15/0.39 % (16553)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (16553)Termination reason: Inappropriate
% 0.15/0.39
% 0.15/0.39 % (16553)Memory used [KB]: 801
% 0.15/0.39 % (16553)Time elapsed: 0.004 s
% 0.15/0.39 % (16553)Instructions burned: 3 (million)
% 0.15/0.39 % (16553)------------------------------
% 0.15/0.39 % (16553)------------------------------
% 0.15/0.40 % (16548)First to succeed.
% 0.15/0.40 % (16548)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-16544"
% 0.15/0.40 % (16551)Also succeeded, but the first one will report.
% 0.15/0.40 % (16548)Refutation found. Thanks to Tanya!
% 0.15/0.40 % SZS status Theorem for theBenchmark
% 0.15/0.40 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.40 % (16548)------------------------------
% 0.15/0.40 % (16548)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.40 % (16548)Termination reason: Refutation
% 0.15/0.40
% 0.15/0.40 % (16548)Memory used [KB]: 873
% 0.15/0.40 % (16548)Time elapsed: 0.015 s
% 0.15/0.40 % (16548)Instructions burned: 14 (million)
% 0.15/0.40 % (16544)Success in time 0.039 s
%------------------------------------------------------------------------------