TSTP Solution File: DAT077_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT077_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_uns --cores 0 -t %d %s
% Computer : n020.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:06 EDT 2022
% Result : Theorem 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 19
% Syntax : Number of formulae : 35 ( 8 unt; 15 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 78 ( 26 ~; 6 |; 36 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 104 ( 53 atm; 0 fun; 11 num; 40 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 30 ( 14 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 11 usr; 1 con; 0-3 aty)
% Number of variables : 51 ( 38 !; 13 ?; 51 :)
% 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 * array ) > $int ).
tff(func_def_13,type,
sK3: ( $int * array ) > $int ).
tff(func_def_14,type,
sK4: ( $int * array ) > $int ).
tff(func_def_15,type,
sK5: $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(f81,plain,
$false,
inference(unit_resulting_resolution,[],[f74,f80,f72]) ).
tff(f72,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| ~ $less(sK3(X0,X1),0) ),
inference(cnf_transformation,[],[f57]) ).
tff(f57,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| ( $less(sK3(X0,X1),sK4(X0,X1))
& ~ $less(sK3(X0,X1),0)
& $less(sK3(X0,X1),X0)
& $less(read(X1,sK4(X0,X1)),read(X1,sK3(X0,X1)))
& $less(sK4(X0,X1),X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f55,f56]) ).
tff(f56,plain,
! [X0: $int,X1: array] :
( ? [X2: $int,X3: $int] :
( $less(X2,X3)
& ~ $less(X2,0)
& $less(X2,X0)
& $less(read(X1,X3),read(X1,X2))
& $less(X3,X0) )
=> ( $less(sK3(X0,X1),sK4(X0,X1))
& ~ $less(sK3(X0,X1),0)
& $less(sK3(X0,X1),X0)
& $less(read(X1,sK4(X0,X1)),read(X1,sK3(X0,X1)))
& $less(sK4(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
tff(f55,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| ? [X2: $int,X3: $int] :
( $less(X2,X3)
& ~ $less(X2,0)
& $less(X2,X0)
& $less(read(X1,X3),read(X1,X2))
& $less(X3,X0) ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X1: $int,X0: array] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(X2,X3)
& ~ $less(X2,0)
& $less(X2,X1)
& $less(read(X0,X3),read(X0,X2))
& $less(X3,X1) ) ),
inference(flattening,[],[f43]) ).
tff(f43,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| ? [X2: $int,X3: $int] :
( $less(read(X0,X3),read(X0,X2))
& $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1)
& ~ $less(X2,0) ) ),
inference(ennf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: array,X1: $int] :
( ! [X2: $int,X3: $int] :
( ( $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) )
=> sorted(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f35]) ).
tff(f35,plain,
! [X0: array,X1: $int] :
( ! [X2: $int,X3: $int] :
( ( $less(X2,X1)
& $less(X2,X3)
& $less(X3,X1)
& ~ $less(X2,0) )
=> ~ $less(read(X0,X3),read(X0,X2)) )
<=> sorted(X0,X1) ),
inference(rectify,[],[f15]) ).
tff(f15,plain,
! [X0: array,X5: $int] :
( ! [X1: $int,X3: $int] :
( ( $less(X1,X5)
& ~ $less(X1,0)
& $less(X1,X3)
& $less(X3,X5) )
=> ~ $less(read(X0,X3),read(X0,X1)) )
<=> sorted(X0,X5) ),
inference(theory_normalization,[],[f6]) ).
tff(f6,axiom,
! [X0: array,X5: $int] :
( ! [X1: $int,X3: $int] :
( ( $less(X1,X5)
& $lesseq(0,X1)
& $less(X1,X3)
& $less(X3,X5) )
=> $lesseq(read(X0,X1),read(X0,X3)) )
<=> sorted(X0,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sorted1) ).
tff(f80,plain,
! [X0: $int] : $less(sK3(X0,rev(init(sK5(X0)),X0)),X0),
inference(resolution,[],[f71,f74]) ).
tff(f71,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| $less(sK3(X0,X1),X0) ),
inference(cnf_transformation,[],[f57]) ).
tff(f74,plain,
! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
inference(cnf_transformation,[],[f59]) ).
tff(f59,plain,
! [X0: $int] : ~ sorted(rev(init(sK5(X0)),X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5])],[f31,f58]) ).
tff(f58,plain,
! [X0: $int] :
( ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0)
=> ~ sorted(rev(init(sK5(X0)),X0),X0) ),
introduced(choice_axiom,[]) ).
tff(f31,plain,
! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(flattening,[],[f30]) ).
tff(f30,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/sandbox/benchmark/theBenchmark.p',c5) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT077=1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 29 20:23:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.48 % (31308)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.48 % (31300)lrs+10_1:8_ep=R:erd=off:fs=off:fsr=off:gve=force:nwc=2.0:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.48 % (31308)First to succeed.
% 0.19/0.48 % (31300)Instruction limit reached!
% 0.19/0.48 % (31300)------------------------------
% 0.19/0.48 % (31300)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (31308)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (31308)------------------------------
% 0.19/0.49 % (31308)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (31308)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (31308)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (31308)Memory used [KB]: 5500
% 0.19/0.49 % (31308)Time elapsed: 0.068 s
% 0.19/0.49 % (31308)Instructions burned: 4 (million)
% 0.19/0.49 % (31308)------------------------------
% 0.19/0.49 % (31308)------------------------------
% 0.19/0.49 % (31290)Success in time 0.133 s
%------------------------------------------------------------------------------