TSTP Solution File: DAT077_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -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 Aug 31 16:04:49 EDT 2022
% Result : Theorem 0.17s 0.49s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 19
% Syntax : Number of formulae : 36 ( 9 unt; 15 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 78 ( 26 ~; 6 |; 36 &)
% ( 3 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 107 ( 53 atm; 0 fun; 14 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: ( array * $int * $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: $int > $int ).
tff(func_def_14,type,
sK4: ( $int * array * array ) > $int ).
tff(func_def_15,type,
sK5: ( 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(f125,plain,
$false,
inference(subsumption_resolution,[],[f122,f69]) ).
tff(f69,plain,
! [X0: $int] : ~ sorted(rev(init(sK3(X0)),X0),X0),
inference(cnf_transformation,[],[f53]) ).
tff(f53,plain,
! [X0: $int] : ~ sorted(rev(init(sK3(X0)),X0),X0),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3])],[f38,f52]) ).
tff(f52,plain,
! [X0: $int] :
( ? [X1: $int] : ~ sorted(rev(init(X1),X0),X0)
=> ~ sorted(rev(init(sK3(X0)),X0),X0) ),
introduced(choice_axiom,[]) ).
tff(f38,plain,
! [X0: $int] :
? [X1: $int] : ~ sorted(rev(init(X1),X0),X0),
inference(flattening,[],[f37]) ).
tff(f37,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(f122,plain,
sorted(rev(init(sK3(0)),0),0),
inference(resolution,[],[f121,f66]) ).
tff(f66,plain,
! [X0: array,X1: $int] :
( ~ $less(sK2(X0,X1),0)
| sorted(X0,X1) ),
inference(cnf_transformation,[],[f51]) ).
tff(f51,plain,
! [X0: array,X1: $int] :
( ( $less(sK1(X0,X1),X1)
& $less(read(X0,sK1(X0,X1)),read(X0,sK2(X0,X1)))
& ~ $less(sK2(X0,X1),0)
& $less(sK2(X0,X1),sK1(X0,X1))
& $less(sK2(X0,X1),X1) )
| sorted(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f49,f50]) ).
tff(f50,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(X2,X1)
& $less(read(X0,X2),read(X0,X3))
& ~ $less(X3,0)
& $less(X3,X2)
& $less(X3,X1) )
=> ( $less(sK1(X0,X1),X1)
& $less(read(X0,sK1(X0,X1)),read(X0,sK2(X0,X1)))
& ~ $less(sK2(X0,X1),0)
& $less(sK2(X0,X1),sK1(X0,X1))
& $less(sK2(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
tff(f49,plain,
! [X0: array,X1: $int] :
( ? [X2: $int,X3: $int] :
( $less(X2,X1)
& $less(read(X0,X2),read(X0,X3))
& ~ $less(X3,0)
& $less(X3,X2)
& $less(X3,X1) )
| sorted(X0,X1) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
! [X1: array,X0: $int] :
( ? [X2: $int,X3: $int] :
( $less(X2,X0)
& $less(read(X1,X2),read(X1,X3))
& ~ $less(X3,0)
& $less(X3,X2)
& $less(X3,X0) )
| sorted(X1,X0) ),
inference(flattening,[],[f42]) ).
tff(f42,plain,
! [X0: $int,X1: array] :
( sorted(X1,X0)
| ? [X3: $int,X2: $int] :
( $less(read(X1,X2),read(X1,X3))
& $less(X3,X0)
& $less(X2,X0)
& $less(X3,X2)
& ~ $less(X3,0) ) ),
inference(ennf_transformation,[],[f40]) ).
tff(f40,plain,
! [X0: $int,X1: array] :
( ! [X3: $int,X2: $int] :
( ( $less(X3,X0)
& $less(X2,X0)
& $less(X3,X2)
& ~ $less(X3,0) )
=> ~ $less(read(X1,X2),read(X1,X3)) )
=> sorted(X1,X0) ),
inference(unused_predicate_definition_removal,[],[f29]) ).
tff(f29,plain,
! [X0: $int,X1: array] :
( ! [X3: $int,X2: $int] :
( ( $less(X3,X0)
& $less(X2,X0)
& $less(X3,X2)
& ~ $less(X3,0) )
=> ~ $less(read(X1,X2),read(X1,X3)) )
<=> sorted(X1,X0) ),
inference(rectify,[],[f12]) ).
tff(f12,plain,
! [X5: $int,X0: array] :
( sorted(X0,X5)
<=> ! [X3: $int,X1: $int] :
( ( $less(X3,X5)
& ~ $less(X1,0)
& $less(X1,X5)
& $less(X1,X3) )
=> ~ $less(read(X0,X3),read(X0,X1)) ) ),
inference(theory_normalization,[],[f6]) ).
tff(f6,axiom,
! [X5: $int,X0: array] :
( sorted(X0,X5)
<=> ! [X3: $int,X1: $int] :
( ( $less(X3,X5)
& $lesseq(0,X1)
& $less(X1,X5)
& $less(X1,X3) )
=> $lesseq(read(X0,X1),read(X0,X3)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1) ).
tff(f121,plain,
! [X0: $int] : $less(sK2(rev(init(sK3(X0)),X0),X0),X0),
inference(resolution,[],[f64,f69]) ).
tff(f64,plain,
! [X0: array,X1: $int] :
( sorted(X0,X1)
| $less(sK2(X0,X1),X1) ),
inference(cnf_transformation,[],[f51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : DAT077=1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Aug 29 19:45:04 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.17/0.47 % (12211)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.17/0.47 % (12213)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.17/0.48 % (12205)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.17/0.48 % (12219)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.17/0.48 % (12219)First to succeed.
% 0.17/0.49 % (12227)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.17/0.49 % (12221)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.17/0.49 % (12221)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.17/0.49 % (12221)Terminated due to inappropriate strategy.
% 0.17/0.49 % (12221)------------------------------
% 0.17/0.49 % (12221)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (12221)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (12221)Termination reason: Inappropriate
% 0.17/0.49
% 0.17/0.49 % (12221)Memory used [KB]: 895
% 0.17/0.49 % (12221)Time elapsed: 0.003 s
% 0.17/0.49 % (12221)Instructions burned: 2 (million)
% 0.17/0.49 % (12221)------------------------------
% 0.17/0.49 % (12221)------------------------------
% 0.17/0.49 % (12211)Instruction limit reached!
% 0.17/0.49 % (12211)------------------------------
% 0.17/0.49 % (12211)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (12213)Also succeeded, but the first one will report.
% 0.17/0.49 % (12209)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.17/0.49 % (12219)Refutation found. Thanks to Tanya!
% 0.17/0.49 % SZS status Theorem for theBenchmark
% 0.17/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.49 % (12219)------------------------------
% 0.17/0.49 % (12219)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.17/0.49 % (12219)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.17/0.49 % (12219)Termination reason: Refutation
% 0.17/0.49
% 0.17/0.49 % (12219)Memory used [KB]: 1023
% 0.17/0.49 % (12219)Time elapsed: 0.115 s
% 0.17/0.49 % (12219)Instructions burned: 6 (million)
% 0.17/0.49 % (12219)------------------------------
% 0.17/0.49 % (12219)------------------------------
% 0.17/0.49 % (12203)Success in time 0.17 s
%------------------------------------------------------------------------------