TSTP Solution File: DAT076_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT076_1 : TPTP v8.1.2. 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 : n017.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 : Wed May 1 02:18:46 EDT 2024
% Result : Theorem 0.72s 0.89s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 3 unt; 13 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 79 ( 26 ~; 8 |; 32 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 91 ( 47 atm; 0 fun; 14 num; 30 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 26 ( 12 >; 14 *; 0 +; 0 <<)
% Number of predicates : 7 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 8 usr; 1 con; 0-3 aty)
% Number of variables : 50 ( 43 !; 6 ?; 50 :)
% ( 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: ( array * $int ) > $int ).
tff(func_def_11,type,
sK1: ( array * $int ) > $int ).
tff(func_def_12,type,
sK2: ( 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,
sQ3_eqProxy:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(f60,plain,
$false,
inference(subsumption_resolution,[],[f59,f58]) ).
tff(f58,plain,
! [X0: array] : sorted(X0,0),
inference(duplicate_literal_removal,[],[f57]) ).
tff(f57,plain,
! [X0: array] :
( sorted(X0,0)
| sorted(X0,0) ),
inference(resolution,[],[f44,f43]) ).
tff(f43,plain,
! [X0: array,X1: $int] :
( ~ $less(sK0(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ( $less(read(X0,sK1(X0,X1)),read(X0,sK0(X0,X1)))
& $less(sK1(X0,X1),X1)
& $less(sK0(X0,X1),sK1(X0,X1))
& $less(sK0(X0,X1),X1)
& ~ $less(sK0(X0,X1),0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f36,f38]) ).
tff(f38,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,sK1(X0,X1)),read(X0,sK0(X0,X1)))
& $less(sK1(X0,X1),X1)
& $less(sK0(X0,X1),sK1(X0,X1))
& $less(sK0(X0,X1),X1)
& ~ $less(sK0(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,[],[f33]) ).
tff(f33,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,[],[f31]) ).
tff(f31,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/tmp/tmp.TPyZt8u4N2/Vampire---4.8_25421',sorted1) ).
tff(f44,plain,
! [X0: array,X1: $int] :
( $less(sK0(X0,X1),X1)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f39]) ).
tff(f59,plain,
! [X0: array] : ~ sorted(X0,0),
inference(resolution,[],[f58,f42]) ).
tff(f42,plain,
! [X0: array,X1: $int] :
( ~ sorted(rev(X0,X1),X1)
| ~ sorted(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: array,X1: $int] :
( ~ sorted(rev(X0,X1),X1)
| ~ sorted(X0,X1) ),
inference(ennf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
inference(flattening,[],[f29]) ).
tff(f29,plain,
~ ~ ! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
inference(rectify,[],[f11]) ).
tff(f11,negated_conjecture,
~ ~ ! [X0: array,X5: $int] :
( sorted(X0,X5)
=> ~ sorted(rev(X0,X5),X5) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
~ ! [X0: array,X5: $int] :
( sorted(X0,X5)
=> ~ sorted(rev(X0,X5),X5) ),
file('/export/starexec/sandbox2/tmp/tmp.TPyZt8u4N2/Vampire---4.8_25421',c4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : DAT076_1 : TPTP v8.1.2. Released v6.1.0.
% 0.13/0.15 % 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.15/0.35 % Computer : n017.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.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Tue Apr 30 16:03:19 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.15/0.36 This is a TF0_THM_EQU_ARI problem
% 0.15/0.36 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/tmp/tmp.TPyZt8u4N2/Vampire---4.8_25421
% 0.72/0.88 % (25690)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 Vampire---4 for (2994ds/34Mi)
% 0.72/0.88 % (25691)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 Vampire---4 for (2994ds/51Mi)
% 0.72/0.88 % (25692)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2994ds/78Mi)
% 0.72/0.88 % (25693)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2994ds/33Mi)
% 0.72/0.88 % (25694)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 Vampire---4 for (2994ds/34Mi)
% 0.72/0.88 % (25696)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 Vampire---4 for (2994ds/83Mi)
% 0.72/0.88 % (25697)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2994ds/56Mi)
% 0.72/0.88 % (25695)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2994ds/45Mi)
% 0.72/0.88 % (25690)First to succeed.
% 0.72/0.88 % (25693)Also succeeded, but the first one will report.
% 0.72/0.88 % (25695)Refutation not found, incomplete strategy% (25695)------------------------------
% 0.72/0.88 % (25695)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.72/0.88 % (25695)Termination reason: Refutation not found, incomplete strategy
% 0.72/0.89
% 0.72/0.89 % (25695)Memory used [KB]: 1023
% 0.72/0.89 % (25695)Time elapsed: 0.003 s
% 0.72/0.89 % (25695)Instructions burned: 3 (million)
% 0.72/0.89 % (25695)------------------------------
% 0.72/0.89 % (25695)------------------------------
% 0.72/0.89 % (25691)Also succeeded, but the first one will report.
% 0.72/0.89 % (25690)Refutation found. Thanks to Tanya!
% 0.72/0.89 % SZS status Theorem for Vampire---4
% 0.72/0.89 % SZS output start Proof for Vampire---4
% See solution above
% 0.72/0.89 % (25690)------------------------------
% 0.72/0.89 % (25690)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.72/0.89 % (25690)Termination reason: Refutation
% 0.72/0.89
% 0.72/0.89 % (25690)Memory used [KB]: 1034
% 0.72/0.89 % (25690)Time elapsed: 0.004 s
% 0.72/0.89 % (25690)Instructions burned: 4 (million)
% 0.72/0.89 % (25690)------------------------------
% 0.72/0.89 % (25690)------------------------------
% 0.72/0.89 % (25614)Success in time 0.519 s
% 0.72/0.89 % Vampire---4.8 exiting
%------------------------------------------------------------------------------