TSTP Solution File: DAT077_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT077_1 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n021.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 : Mon May 20 19:49:33 EDT 2024
% Result : Theorem 0.60s 0.78s
% Output : Refutation 0.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 18
% Syntax : Number of formulae : 34 ( 8 unt; 14 typ; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 73 ( 25 ~; 6 |; 32 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 96 ( 47 atm; 0 fun; 13 num; 36 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 27 ( 13 >; 14 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 49 ( 37 !; 11 ?; 49 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% 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: $int > $int ).
tff(func_def_11,type,
sK1: ( array * $int ) > $int ).
tff(func_def_12,type,
sK2: ( array * $int ) > $int ).
tff(func_def_13,type,
sK3: ( 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(pred_def_8,type,
sQ4_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f63,plain,
$false,
inference(resolution,[],[f62,f44]) ).
tff(f44,plain,
! [X0: $int] : ~ sorted(rev(init(sK0(X0)),X0),X0),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: $int] : ~ sorted(rev(init(sK0(X0)),X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f30,f38]) ).
tff(f38,plain,
! [X0: $int] :
( ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0)
=> ~ sorted(rev(init(sK0(X0)),X0),X0) ),
introduced(choice_axiom,[]) ).
tff(f30,plain,
! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(flattening,[],[f29]) ).
tff(f29,plain,
~ ~ ! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(rectify,[],[f11]) ).
tff(f11,negated_conjecture,
~ ~ ! [X8: $int] :
? [X5: $int] : ~ sorted(rev(init(X5),X8),X8),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
~ ! [X8: $int] :
? [X5: $int] : ~ sorted(rev(init(X5),X8),X8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c5) ).
tff(f62,plain,
! [X0: array] : sorted(X0,0),
inference(duplicate_literal_removal,[],[f61]) ).
tff(f61,plain,
! [X0: array] :
( sorted(X0,0)
| sorted(X0,0) ),
inference(resolution,[],[f47,f46]) ).
tff(f46,plain,
! [X0: array,X1: $int] :
( ~ $less(sK1(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tff(f41,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ( $less(read(X0,sK2(X0,X1)),read(X0,sK1(X0,X1)))
& $less(sK2(X0,X1),X1)
& $less(sK1(X0,X1),sK2(X0,X1))
& $less(sK1(X0,X1),X1)
& ~ $less(sK1(X0,X1),0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f36,f40]) ).
tff(f40,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) )
=> ( $less(read(X0,sK2(X0,X1)),read(X0,sK1(X0,X1)))
& $less(sK2(X0,X1),X1)
& $less(sK1(X0,X1),sK2(X0,X1))
& $less(sK1(X0,X1),X1)
& ~ $less(sK1(X0,X1),0) ) ),
introduced(choice_axiom,[]) ).
tff(f36,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) ) ),
inference(flattening,[],[f35]) ).
tff(f35,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) ) ),
inference(ennf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: array,X1: $int] :
( ! [X2: $int,X3: $int] :
( ( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) )
=> sorted(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f32]) ).
tff(f32,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
<=> ! [X2: $int,X3: $int] :
( ( $less(X3,X1)
& $less(X2,X3)
& $less(X2,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) ) ),
inference(rectify,[],[f13]) ).
tff(f13,plain,
! [X0: array,X5: $int] :
( sorted(X0,X5)
<=> ! [X1: $int,X3: $int] :
( ( $less(X3,X5)
& $less(X1,X3)
& $less(X1,X5)
& ~ $less(X1,0) )
=> ~ $less(read(X0,X3),read(X0,X1)) ) ),
inference(theory_normalization,[],[f6]) ).
tff(f6,axiom,
! [X0: array,X5: $int] :
( sorted(X0,X5)
<=> ! [X1: $int,X3: $int] :
( ( $less(X3,X5)
& $less(X1,X3)
& $less(X1,X5)
& $lesseq(0,X1) )
=> $lesseq(read(X0,X1),read(X0,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1) ).
tff(f47,plain,
! [X0: array,X1: $int] :
( $less(sK1(X0,X1),X1)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.09 % Problem : DAT077_1 : TPTP v8.2.0. Released v6.1.0.
% 0.04/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.09/0.30 % Computer : n021.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun May 19 23:08:22 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.09/0.30 This is a TF0_THM_EQU_ARI problem
% 0.09/0.30 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.60/0.78 % (32137)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (32139)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.78 % (32138)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.78 % (32140)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.78 % (32141)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78 % (32142)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.78 % (32143)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.78 % (32144)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.78 % (32137)First to succeed.
% 0.60/0.78 % (32142)Refutation not found, incomplete strategy% (32142)------------------------------
% 0.60/0.78 % (32142)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (32142)Termination reason: Refutation not found, incomplete strategy
% 0.60/0.78
% 0.60/0.78 % (32142)Memory used [KB]: 1026
% 0.60/0.78 % (32142)Time elapsed: 0.003 s
% 0.60/0.78 % (32140)Also succeeded, but the first one will report.
% 0.60/0.78 % (32142)Instructions burned: 3 (million)
% 0.60/0.78 % (32142)------------------------------
% 0.60/0.78 % (32142)------------------------------
% 0.60/0.78 % (32144)Also succeeded, but the first one will report.
% 0.60/0.78 % (32137)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-32135"
% 0.60/0.78 % (32143)Also succeeded, but the first one will report.
% 0.60/0.78 % (32141)Also succeeded, but the first one will report.
% 0.60/0.78 % (32138)Also succeeded, but the first one will report.
% 0.60/0.78 % (32137)Refutation found. Thanks to Tanya!
% 0.60/0.78 % SZS status Theorem for theBenchmark
% 0.60/0.78 % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.78 % (32137)------------------------------
% 0.60/0.78 % (32137)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.78 % (32137)Termination reason: Refutation
% 0.60/0.78
% 0.60/0.78 % (32137)Memory used [KB]: 1035
% 0.60/0.78 % (32137)Time elapsed: 0.004 s
% 0.60/0.78 % (32137)Instructions burned: 4 (million)
% 0.60/0.78 % (32135)Success in time 0.471 s
% 0.60/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------