TSTP Solution File: DAT076_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT076_1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -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 : Wed Aug 31 16:04:49 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 17
% Syntax : Number of formulae : 41 ( 3 unt; 14 typ; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 101 ( 37 ~; 15 |; 36 &)
% ( 3 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 126 ( 64 atm; 0 fun; 23 num; 39 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 29 ( 13 >; 16 *; 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 : 65 ( 57 !; 8 ?; 65 :)
% 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 * array ) > $int ).
tff(func_def_11,type,
sK1: ( $int * array * array ) > $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 ).
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(f342,plain,
$false,
inference(subsumption_resolution,[],[f339,f322]) ).
tff(f322,plain,
! [X4: array] : ~ $less(sK3(X4,0),0),
inference(duplicate_literal_removal,[],[f319]) ).
tff(f319,plain,
! [X4: array] :
( ~ $less(sK3(X4,0),0)
| ~ $less(sK3(X4,0),0) ),
inference(resolution,[],[f310,f308]) ).
tff(f308,plain,
! [X2: array,X3: $int] :
( $less(sK3(rev(X2,X3),X3),X3)
| ~ $less(sK3(X2,X3),0) ),
inference(resolution,[],[f71,f153]) ).
tff(f153,plain,
! [X0: array,X1: $int] :
( ~ sorted(X0,X1)
| $less(sK3(rev(X0,X1),X1),X1) ),
inference(resolution,[],[f70,f74]) ).
tff(f74,plain,
! [X0: $int,X1: array] :
( ~ sorted(rev(X1,X0),X0)
| ~ sorted(X1,X0) ),
inference(cnf_transformation,[],[f58]) ).
tff(f58,plain,
! [X0: $int,X1: array] :
( ~ sorted(rev(X1,X0),X0)
| ~ sorted(X1,X0) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
! [X1: $int,X0: array] :
( ~ sorted(rev(X0,X1),X1)
| ~ sorted(X0,X1) ),
inference(ennf_transformation,[],[f33]) ).
tff(f33,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
=> ~ sorted(rev(X0,X1),X1) ),
inference(flattening,[],[f32]) ).
tff(f32,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/sandbox/benchmark/theBenchmark.p',c4) ).
tff(f70,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| $less(sK3(X0,X1),X1) ),
inference(cnf_transformation,[],[f57]) ).
tff(f57,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ( $less(read(X0,sK2(X0,X1)),read(X0,sK3(X0,X1)))
& $less(sK3(X0,X1),sK2(X0,X1))
& ~ $less(sK3(X0,X1),0)
& $less(sK3(X0,X1),X1)
& $less(sK2(X0,X1),X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f55,f56]) ).
tff(f56,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(read(X0,X2),read(X0,X3))
& $less(X3,X2)
& ~ $less(X3,0)
& $less(X3,X1)
& $less(X2,X1) )
=> ( $less(read(X0,sK2(X0,X1)),read(X0,sK3(X0,X1)))
& $less(sK3(X0,X1),sK2(X0,X1))
& ~ $less(sK3(X0,X1),0)
& $less(sK3(X0,X1),X1)
& $less(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
tff(f55,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X2),read(X0,X3))
& $less(X3,X2)
& ~ $less(X3,0)
& $less(X3,X1)
& $less(X2,X1) ) ),
inference(rectify,[],[f41]) ).
tff(f41,plain,
! [X1: array,X0: $int] :
( sorted(X1,X0)
| ? [X3: $int,X2: $int] :
( $less(read(X1,X3),read(X1,X2))
& $less(X2,X3)
& ~ $less(X2,0)
& $less(X2,X0)
& $less(X3,X0) ) ),
inference(flattening,[],[f40]) ).
tff(f40,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| ? [X3: $int,X2: $int] :
( $less(read(X1,X3),read(X1,X2))
& ~ $less(X2,0)
& $less(X3,X0)
& $less(X2,X3)
& $less(X2,X0) ) ),
inference(ennf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: $int,X1: array] :
( ! [X3: $int,X2: $int] :
( ( ~ $less(X2,0)
& $less(X3,X0)
& $less(X2,X3)
& $less(X2,X0) )
=> ~ $less(read(X1,X3),read(X1,X2)) )
=> sorted(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f31]) ).
tff(f31,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
<=> ! [X3: $int,X2: $int] :
( ( ~ $less(X2,0)
& $less(X3,X0)
& $less(X2,X3)
& $less(X2,X0) )
=> ~ $less(read(X1,X3),read(X1,X2)) ) ),
inference(rectify,[],[f13]) ).
tff(f13,plain,
! [X5: $int,X0: array] :
( 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,
! [X5: $int,X0: array] :
( 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/sandbox/benchmark/theBenchmark.p',sorted1) ).
tff(f71,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ~ $less(sK3(X0,X1),0) ),
inference(cnf_transformation,[],[f57]) ).
tff(f310,plain,
! [X0: array,X1: $int] :
( ~ $less(sK3(rev(X0,X1),X1),0)
| ~ $less(sK3(X0,X1),0) ),
inference(resolution,[],[f307,f71]) ).
tff(f307,plain,
! [X0: array,X1: $int] :
( ~ sorted(X0,X1)
| ~ $less(sK3(rev(X0,X1),X1),0) ),
inference(resolution,[],[f71,f74]) ).
tff(f339,plain,
! [X5: array] : $less(sK3(X5,0),0),
inference(resolution,[],[f322,f155]) ).
tff(f155,plain,
! [X0: array,X1: $int] :
( $less(sK3(rev(X0,X1),X1),X1)
| $less(sK3(X0,X1),X1) ),
inference(resolution,[],[f153,f70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : DAT076=1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 20:13:44 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.49 % (26298)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.19/0.49 % (26290)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.50 % (26289)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.19/0.50 % (26282)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.50 % (26282)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.19/0.50 % (26282)Terminated due to inappropriate strategy.
% 0.19/0.50 % (26282)------------------------------
% 0.19/0.50 % (26282)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50 % (26282)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50 % (26282)Termination reason: Inappropriate
% 0.19/0.50
% 0.19/0.50 % (26282)Memory used [KB]: 895
% 0.19/0.50 % (26282)Time elapsed: 0.006 s
% 0.19/0.50 % (26282)Instructions burned: 3 (million)
% 0.19/0.50 % (26282)------------------------------
% 0.19/0.50 % (26282)------------------------------
% 0.19/0.51 % (26283)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.19/0.51 % (26299)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.19/0.51 % (26287)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.19/0.52 % (26298)First to succeed.
% 0.19/0.52 % (26288)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.52 % (26298)Refutation found. Thanks to Tanya!
% 0.19/0.52 % SZS status Theorem for theBenchmark
% 0.19/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52 % (26298)------------------------------
% 0.19/0.52 % (26298)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (26298)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (26298)Termination reason: Refutation
% 0.19/0.52
% 0.19/0.52 % (26298)Memory used [KB]: 1151
% 0.19/0.52 % (26298)Time elapsed: 0.073 s
% 0.19/0.52 % (26298)Instructions burned: 19 (million)
% 0.19/0.52 % (26298)------------------------------
% 0.19/0.52 % (26298)------------------------------
% 0.19/0.52 % (26275)Success in time 0.178 s
%------------------------------------------------------------------------------