TSTP Solution File: DAT071_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT071_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 : n024.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:48 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 23
% Syntax : Number of formulae : 48 ( 11 unt; 18 typ; 0 def)
% Number of atoms : 174 ( 39 equ)
% Maximal formula atoms : 26 ( 5 avg)
% Number of connectives : 221 ( 77 ~; 37 |; 92 &)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 253 ( 134 atm; 0 fun; 51 num; 68 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 11 >; 14 *; 0 +; 0 <<)
% Number of predicates : 9 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 76 ( 40 !; 36 ?; 76 :)
% 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 * array ) > $int ).
tff(func_def_12,type,
sK2: array ).
tff(func_def_13,type,
sK3: $int ).
tff(func_def_14,type,
sK4: $int ).
tff(func_def_15,type,
sK5: $int ).
tff(func_def_16,type,
sK6: $int ).
tff(func_def_17,type,
sK7: $int ).
tff(func_def_18,type,
sK8: ( 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(f110,plain,
$false,
inference(subsumption_resolution,[],[f109,f85]) ).
tff(f85,plain,
~ $less(sK4,sK5),
inference(subsumption_resolution,[],[f84,f71]) ).
tff(f71,plain,
$less(sK6,sK3),
inference(cnf_transformation,[],[f55]) ).
tff(f55,plain,
( ~ $less(sK6,0)
& $less(sK6,sK3)
& ( read(sK2,sK6) = sK5 )
& ! [X5: $int] :
( ~ $less(X5,sK3)
| $less(X5,0)
| ~ $less(sK5,read(sK2,X5)) )
& ! [X6: $int] :
( $less(X6,0)
| ~ $less(X6,sK3)
| ~ $less(sK4,read(sK2,X6)) )
& ( sK4 != sK5 )
& ~ $less(sK7,0)
& ( sK4 = read(sK2,sK7) )
& $less(sK7,sK3) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6,sK7])],[f51,f54,f53,f52]) ).
tff(f52,plain,
( ? [X0: array,X1: $int,X2: $int,X3: $int] :
( ? [X4: $int] :
( ~ $less(X4,0)
& $less(X4,X1)
& ( read(X0,X4) = X3 ) )
& ! [X5: $int] :
( ~ $less(X5,X1)
| $less(X5,0)
| ~ $less(X3,read(X0,X5)) )
& ! [X6: $int] :
( $less(X6,0)
| ~ $less(X6,X1)
| ~ $less(X2,read(X0,X6)) )
& ( X2 != X3 )
& ? [X7: $int] :
( ~ $less(X7,0)
& ( read(X0,X7) = X2 )
& $less(X7,X1) ) )
=> ( ? [X4: $int] :
( ~ $less(X4,0)
& $less(X4,sK3)
& ( read(sK2,X4) = sK5 ) )
& ! [X5: $int] :
( ~ $less(X5,sK3)
| $less(X5,0)
| ~ $less(sK5,read(sK2,X5)) )
& ! [X6: $int] :
( $less(X6,0)
| ~ $less(X6,sK3)
| ~ $less(sK4,read(sK2,X6)) )
& ( sK4 != sK5 )
& ? [X7: $int] :
( ~ $less(X7,0)
& ( sK4 = read(sK2,X7) )
& $less(X7,sK3) ) ) ),
introduced(choice_axiom,[]) ).
tff(f53,plain,
( ? [X4: $int] :
( ~ $less(X4,0)
& $less(X4,sK3)
& ( read(sK2,X4) = sK5 ) )
=> ( ~ $less(sK6,0)
& $less(sK6,sK3)
& ( read(sK2,sK6) = sK5 ) ) ),
introduced(choice_axiom,[]) ).
tff(f54,plain,
( ? [X7: $int] :
( ~ $less(X7,0)
& ( sK4 = read(sK2,X7) )
& $less(X7,sK3) )
=> ( ~ $less(sK7,0)
& ( sK4 = read(sK2,sK7) )
& $less(sK7,sK3) ) ),
introduced(choice_axiom,[]) ).
tff(f51,plain,
? [X0: array,X1: $int,X2: $int,X3: $int] :
( ? [X4: $int] :
( ~ $less(X4,0)
& $less(X4,X1)
& ( read(X0,X4) = X3 ) )
& ! [X5: $int] :
( ~ $less(X5,X1)
| $less(X5,0)
| ~ $less(X3,read(X0,X5)) )
& ! [X6: $int] :
( $less(X6,0)
| ~ $less(X6,X1)
| ~ $less(X2,read(X0,X6)) )
& ( X2 != X3 )
& ? [X7: $int] :
( ~ $less(X7,0)
& ( read(X0,X7) = X2 )
& $less(X7,X1) ) ),
inference(rectify,[],[f42]) ).
tff(f42,plain,
? [X0: array,X1: $int,X3: $int,X2: $int] :
( ? [X6: $int] :
( ~ $less(X6,0)
& $less(X6,X1)
& ( read(X0,X6) = X2 ) )
& ! [X5: $int] :
( ~ $less(X5,X1)
| $less(X5,0)
| ~ $less(X2,read(X0,X5)) )
& ! [X7: $int] :
( $less(X7,0)
| ~ $less(X7,X1)
| ~ $less(X3,read(X0,X7)) )
& ( X2 != X3 )
& ? [X4: $int] :
( ~ $less(X4,0)
& ( read(X0,X4) = X3 )
& $less(X4,X1) ) ),
inference(flattening,[],[f41]) ).
tff(f41,plain,
? [X0: array,X2: $int,X1: $int,X3: $int] :
( ( X2 != X3 )
& ! [X7: $int] :
( ~ $less(X3,read(X0,X7))
| ~ $less(X7,X1)
| $less(X7,0) )
& ? [X4: $int] :
( ~ $less(X4,0)
& ( read(X0,X4) = X3 )
& $less(X4,X1) )
& ! [X5: $int] :
( ~ $less(X2,read(X0,X5))
| $less(X5,0)
| ~ $less(X5,X1) )
& ? [X6: $int] :
( ~ $less(X6,0)
& $less(X6,X1)
& ( read(X0,X6) = X2 ) ) ),
inference(ennf_transformation,[],[f37]) ).
tff(f37,plain,
~ ! [X0: array,X2: $int,X1: $int,X3: $int] :
( ( ! [X7: $int] :
( ( $less(X7,X1)
& ~ $less(X7,0) )
=> ~ $less(X3,read(X0,X7)) )
& ? [X4: $int] :
( ~ $less(X4,0)
& ( read(X0,X4) = X3 )
& $less(X4,X1) )
& ! [X5: $int] :
( ( ~ $less(X5,0)
& $less(X5,X1) )
=> ~ $less(X2,read(X0,X5)) )
& ? [X6: $int] :
( ~ $less(X6,0)
& $less(X6,X1)
& ( read(X0,X6) = X2 ) ) )
=> ( X2 = X3 ) ),
inference(rectify,[],[f16]) ).
tff(f16,plain,
~ ! [X0: array,X5: $int,X9: $int,X8: $int] :
( ( ? [X1: $int] :
( $less(X1,X5)
& ~ $less(X1,0)
& ( read(X0,X1) = X8 ) )
& ! [X1: $int] :
( ( $less(X1,X5)
& ~ $less(X1,0) )
=> ~ $less(X9,read(X0,X1)) )
& ? [X1: $int] :
( $less(X1,X5)
& ~ $less(X1,0)
& ( read(X0,X1) = X9 ) )
& ! [X1: $int] :
( ( ~ $less(X1,0)
& $less(X1,X5) )
=> ~ $less(X8,read(X0,X1)) ) )
=> ( X8 = X9 ) ),
inference(theory_normalization,[],[f11]) ).
tff(f11,negated_conjecture,
~ ! [X0: array,X5: $int,X9: $int,X8: $int] :
( ( ? [X1: $int] :
( $greater(X5,X1)
& $greatereq(X1,0)
& ( read(X0,X1) = X8 ) )
& ! [X1: $int] :
( ( $greater(X5,X1)
& $greatereq(X1,0) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( $greater(X5,X1)
& $greatereq(X1,0)
& ( read(X0,X1) = X9 ) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
inference(negated_conjecture,[],[f10]) ).
tff(f10,conjecture,
! [X0: array,X5: $int,X9: $int,X8: $int] :
( ( ? [X1: $int] :
( $greater(X5,X1)
& $greatereq(X1,0)
& ( read(X0,X1) = X8 ) )
& ! [X1: $int] :
( ( $greater(X5,X1)
& $greatereq(X1,0) )
=> $lesseq(read(X0,X1),X9) )
& ? [X1: $int] :
( $greater(X5,X1)
& $greatereq(X1,0)
& ( read(X0,X1) = X9 ) )
& ! [X1: $int] :
( ( $greatereq(X1,0)
& $greater(X5,X1) )
=> $lesseq(read(X0,X1),X8) ) )
=> ( X8 = X9 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f84,plain,
( ~ $less(sK6,sK3)
| ~ $less(sK4,sK5) ),
inference(subsumption_resolution,[],[f83,f72]) ).
tff(f72,plain,
~ $less(sK6,0),
inference(cnf_transformation,[],[f55]) ).
tff(f83,plain,
( $less(sK6,0)
| ~ $less(sK4,sK5)
| ~ $less(sK6,sK3) ),
inference(superposition,[],[f68,f70]) ).
tff(f70,plain,
read(sK2,sK6) = sK5,
inference(cnf_transformation,[],[f55]) ).
tff(f68,plain,
! [X6: $int] :
( ~ $less(sK4,read(sK2,X6))
| $less(X6,0)
| ~ $less(X6,sK3) ),
inference(cnf_transformation,[],[f55]) ).
tff(f109,plain,
$less(sK4,sK5),
inference(subsumption_resolution,[],[f98,f67]) ).
tff(f67,plain,
sK4 != sK5,
inference(cnf_transformation,[],[f55]) ).
tff(f98,plain,
( ( sK4 = sK5 )
| $less(sK4,sK5) ),
inference(resolution,[],[f25,f89]) ).
tff(f89,plain,
~ $less(sK5,sK4),
inference(subsumption_resolution,[],[f88,f66]) ).
tff(f66,plain,
~ $less(sK7,0),
inference(cnf_transformation,[],[f55]) ).
tff(f88,plain,
( ~ $less(sK5,sK4)
| $less(sK7,0) ),
inference(subsumption_resolution,[],[f86,f64]) ).
tff(f64,plain,
$less(sK7,sK3),
inference(cnf_transformation,[],[f55]) ).
tff(f86,plain,
( ~ $less(sK7,sK3)
| ~ $less(sK5,sK4)
| $less(sK7,0) ),
inference(superposition,[],[f69,f65]) ).
tff(f65,plain,
sK4 = read(sK2,sK7),
inference(cnf_transformation,[],[f55]) ).
tff(f69,plain,
! [X5: $int] :
( ~ $less(sK5,read(sK2,X5))
| $less(X5,0)
| ~ $less(X5,sK3) ),
inference(cnf_transformation,[],[f55]) ).
tff(f25,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT071=1 : TPTP v8.1.0. Released v6.1.0.
% 0.13/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.35 % Computer : n024.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:22:49 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 % (13948)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.48 % (13946)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.20/0.48 % (13948)Instruction limit reached!
% 0.20/0.48 % (13948)------------------------------
% 0.20/0.48 % (13948)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (13948)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (13948)Termination reason: Unknown
% 0.20/0.48 % (13948)Termination phase: Saturation
% 0.20/0.48
% 0.20/0.48 % (13948)Memory used [KB]: 5500
% 0.20/0.48 % (13948)Time elapsed: 0.089 s
% 0.20/0.48 % (13948)Instructions burned: 8 (million)
% 0.20/0.48 % (13948)------------------------------
% 0.20/0.48 % (13948)------------------------------
% 0.20/0.49 % (13964)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.20/0.49 % (13964)First to succeed.
% 0.20/0.49 % (13964)Refutation found. Thanks to Tanya!
% 0.20/0.49 % SZS status Theorem for theBenchmark
% 0.20/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.49 % (13964)------------------------------
% 0.20/0.49 % (13964)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (13964)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (13964)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (13964)Memory used [KB]: 5500
% 0.20/0.49 % (13964)Time elapsed: 0.102 s
% 0.20/0.49 % (13964)Instructions burned: 5 (million)
% 0.20/0.49 % (13964)------------------------------
% 0.20/0.49 % (13964)------------------------------
% 0.20/0.49 % (13940)Success in time 0.138 s
%------------------------------------------------------------------------------