TSTP Solution File: DAT011_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT011_1 : TPTP v8.1.0. Released v5.0.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 : n013.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:37 EDT 2022
% Result : Theorem 0.20s 0.49s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of formulae : 59 ( 22 unt; 11 typ; 0 def)
% Number of atoms : 135 ( 45 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 133 ( 46 ~; 33 |; 40 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 255 ( 89 atm; 31 fun; 73 num; 62 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 10 usr; 11 con; 0-3 aty)
% Number of variables : 85 ( 63 !; 22 ?; 85 :)
% 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_7,type,
sK0: array ).
tff(func_def_8,type,
sK1: array ).
tff(func_def_9,type,
sK2: $int ).
tff(func_def_10,type,
sK3: $int ).
tff(func_def_11,type,
sK4: $int ).
tff(func_def_12,type,
sF5: $int ).
tff(func_def_13,type,
sF6: $int ).
tff(func_def_14,type,
sF7: array ).
tff(f220,plain,
$false,
inference(evaluation,[],[f201]) ).
tff(f201,plain,
~ $less(0,3),
inference(backward_demodulation,[],[f36,f200]) ).
tff(f200,plain,
3 = sF5,
inference(backward_demodulation,[],[f35,f193]) ).
tff(f193,plain,
3 = read(sK1,sK4),
inference(backward_demodulation,[],[f65,f187]) ).
tff(f187,plain,
sF6 = sK4,
inference(subsumption_resolution,[],[f186,f81]) ).
tff(f81,plain,
( $less(sK4,sF6)
| ( sF6 = sK4 ) ),
inference(resolution,[],[f13,f38]) ).
tff(f38,plain,
~ $less(sF6,sK4),
inference(definition_folding,[],[f30,f37]) ).
tff(f37,plain,
sF6 = $sum(sK2,1),
introduced(function_definition,[]) ).
tff(f30,plain,
~ $less($sum(sK2,1),sK4),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
( ! [X4: $int] :
( $less(sK2,X4)
| $less(0,read(sK0,X4))
| $less(X4,sK3) )
& ~ $less(sK4,sK3)
& ~ $less(0,read(sK1,sK4))
& ~ $less($sum(sK2,1),sK4)
& ( write(sK0,$sum(sK2,1),3) = sK1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f23,f25,f24]) ).
tff(f24,plain,
( ? [X0: array,X1: array,X2: $int,X3: $int] :
( ! [X4: $int] :
( $less(X2,X4)
| $less(0,read(X0,X4))
| $less(X4,X3) )
& ? [X5: $int] :
( ~ $less(X5,X3)
& ~ $less(0,read(X1,X5))
& ~ $less($sum(X2,1),X5) )
& ( write(X0,$sum(X2,1),3) = X1 ) )
=> ( ! [X4: $int] :
( $less(sK2,X4)
| $less(0,read(sK0,X4))
| $less(X4,sK3) )
& ? [X5: $int] :
( ~ $less(X5,sK3)
& ~ $less(0,read(sK1,X5))
& ~ $less($sum(sK2,1),X5) )
& ( write(sK0,$sum(sK2,1),3) = sK1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
( ? [X5: $int] :
( ~ $less(X5,sK3)
& ~ $less(0,read(sK1,X5))
& ~ $less($sum(sK2,1),X5) )
=> ( ~ $less(sK4,sK3)
& ~ $less(0,read(sK1,sK4))
& ~ $less($sum(sK2,1),sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f23,plain,
? [X0: array,X1: array,X2: $int,X3: $int] :
( ! [X4: $int] :
( $less(X2,X4)
| $less(0,read(X0,X4))
| $less(X4,X3) )
& ? [X5: $int] :
( ~ $less(X5,X3)
& ~ $less(0,read(X1,X5))
& ~ $less($sum(X2,1),X5) )
& ( write(X0,$sum(X2,1),3) = X1 ) ),
inference(rectify,[],[f21]) ).
tff(f21,plain,
? [X2: array,X1: array,X0: $int,X3: $int] :
( ! [X4: $int] :
( $less(X0,X4)
| $less(0,read(X2,X4))
| $less(X4,X3) )
& ? [X5: $int] :
( ~ $less(X5,X3)
& ~ $less(0,read(X1,X5))
& ~ $less($sum(X0,1),X5) )
& ( write(X2,$sum(X0,1),3) = X1 ) ),
inference(flattening,[],[f20]) ).
tff(f20,plain,
? [X3: $int,X2: array,X0: $int,X1: array] :
( ? [X5: $int] :
( ~ $less(0,read(X1,X5))
& ~ $less(X5,X3)
& ~ $less($sum(X0,1),X5) )
& ( write(X2,$sum(X0,1),3) = X1 )
& ! [X4: $int] :
( $less(0,read(X2,X4))
| $less(X4,X3)
| $less(X0,X4) ) ),
inference(ennf_transformation,[],[f18]) ).
tff(f18,plain,
~ ! [X3: $int,X2: array,X0: $int,X1: array] :
( ( ( write(X2,$sum(X0,1),3) = X1 )
& ! [X4: $int] :
( ( ~ $less(X4,X3)
& ~ $less(X0,X4) )
=> $less(0,read(X2,X4)) ) )
=> ! [X5: $int] :
( ( ~ $less(X5,X3)
& ~ $less($sum(X0,1),X5) )
=> $less(0,read(X1,X5)) ) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
~ ! [X3: $int,X0: array,X1: array,X2: $int] :
( ( ! [X4: $int] :
( ( ~ $less(X4,X2)
& ~ $less(X3,X4) )
=> $less(0,read(X1,X4)) )
& ( write(X1,$sum(X3,1),3) = X0 ) )
=> ! [X5: $int] :
( ( ~ $less($sum(X3,1),X5)
& ~ $less(X5,X2) )
=> $less(0,read(X0,X5)) ) ),
inference(theory_normalization,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X3: $int,X0: array,X1: array,X2: $int] :
( ( ! [X4: $int] :
( ( $lesseq(X2,X4)
& $lesseq(X4,X3) )
=> $greater(read(X1,X4),0) )
& ( write(X1,$sum(X3,1),3) = X0 ) )
=> ! [X5: $int] :
( ( $lesseq(X5,$sum(X3,1))
& $lesseq(X2,X5) )
=> $greater(read(X0,X5),0) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X3: $int,X0: array,X1: array,X2: $int] :
( ( ! [X4: $int] :
( ( $lesseq(X2,X4)
& $lesseq(X4,X3) )
=> $greater(read(X1,X4),0) )
& ( write(X1,$sum(X3,1),3) = X0 ) )
=> ! [X5: $int] :
( ( $lesseq(X5,$sum(X3,1))
& $lesseq(X2,X5) )
=> $greater(read(X0,X5),0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f13,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,X0)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f186,plain,
( ( sF6 = sK4 )
| ~ $less(sK4,sF6) ),
inference(forward_demodulation,[],[f185,f50]) ).
tff(f50,plain,
sF6 = $sum(1,sK2),
inference(superposition,[],[f37,f6]) ).
tff(f6,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f185,plain,
( ( sF6 = sK4 )
| ~ $less(sK4,$sum(1,sK2)) ),
inference(forward_demodulation,[],[f184,f6]) ).
tff(f184,plain,
( ~ $less(sK4,$sum(sK2,1))
| ( sF6 = sK4 ) ),
inference(resolution,[],[f181,f17]) ).
tff(f17,plain,
! [X0: $int,X1: $int] :
( ~ $less(X0,X1)
| ~ $less(X1,$sum(X0,1)) ),
introduced(theory_axiom_166,[]) ).
tff(f181,plain,
( $less(sK2,sK4)
| ( sF6 = sK4 ) ),
inference(subsumption_resolution,[],[f180,f32]) ).
tff(f32,plain,
~ $less(sK4,sK3),
inference(cnf_transformation,[],[f26]) ).
tff(f180,plain,
( $less(sK4,sK3)
| ( sF6 = sK4 )
| $less(sK2,sK4) ),
inference(subsumption_resolution,[],[f179,f36]) ).
tff(f179,plain,
( $less(0,sF5)
| ( sF6 = sK4 )
| $less(sK4,sK3)
| $less(sK2,sK4) ),
inference(superposition,[],[f33,f153]) ).
tff(f153,plain,
( ( read(sK0,sK4) = sF5 )
| ( sF6 = sK4 ) ),
inference(superposition,[],[f150,f35]) ).
tff(f150,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(sK1,X0) )
| ( sF6 = X0 ) ),
inference(superposition,[],[f34,f41]) ).
tff(f41,plain,
write(sK0,sF6,3) = sK1,
inference(forward_demodulation,[],[f39,f40]) ).
tff(f40,plain,
sF7 = sK1,
inference(definition_folding,[],[f29,f39,f37]) ).
tff(f29,plain,
write(sK0,$sum(sK2,1),3) = sK1,
inference(cnf_transformation,[],[f26]) ).
tff(f39,plain,
sF7 = write(sK0,sF6,3),
introduced(function_definition,[]) ).
tff(f34,plain,
! [X2: $int,X3: array,X0: $int,X1: $int] :
( ( read(write(X3,X2,X1),X0) = read(X3,X0) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0: $int,X1: $int,X2: $int,X3: array] :
( ( read(write(X3,X2,X1),X0) = read(X3,X0) )
| ( X0 = X2 ) ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
! [X2: $int,X0: $int,X3: $int,X1: array] :
( ( read(X1,X2) = read(write(X1,X3,X0),X2) )
| ( X2 = X3 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X6: $int,X3: array,X5: $int,X4: $int] :
( ( X4 = X5 )
| ( read(write(X3,X4,X6),X5) = read(X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f33,plain,
! [X4: $int] :
( $less(0,read(sK0,X4))
| $less(sK2,X4)
| $less(X4,sK3) ),
inference(cnf_transformation,[],[f26]) ).
tff(f65,plain,
3 = read(sK1,sF6),
inference(superposition,[],[f28,f41]) ).
tff(f28,plain,
! [X2: array,X0: $int,X1: $int] : ( read(write(X2,X0,X1),X0) = X1 ),
inference(cnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: $int,X2: array] : ( read(write(X2,X0,X1),X0) = X1 ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X1: $int,X2: $int,X0: array] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f35,plain,
read(sK1,sK4) = sF5,
introduced(function_definition,[]) ).
tff(f36,plain,
~ $less(0,sF5),
inference(definition_folding,[],[f31,f35]) ).
tff(f31,plain,
~ $less(0,read(sK1,sK4)),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : DAT011=1 : TPTP v8.1.0. Released v5.0.0.
% 0.12/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.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Aug 29 20:12:17 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.45 % (14286)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 (3000ds/467Mi)
% 0.20/0.46 % (14278)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 (3000ds/75Mi)
% 0.20/0.47 % (14270)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.20/0.48 % (14278)First to succeed.
% 0.20/0.48 % (14270)Instruction limit reached!
% 0.20/0.48 % (14270)------------------------------
% 0.20/0.48 % (14270)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (14270)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (14270)Termination reason: Unknown
% 0.20/0.48 % (14270)Termination phase: Saturation
% 0.20/0.48
% 0.20/0.48 % (14270)Memory used [KB]: 5500
% 0.20/0.48 % (14270)Time elapsed: 0.057 s
% 0.20/0.48 % (14270)Instructions burned: 7 (million)
% 0.20/0.48 % (14270)------------------------------
% 0.20/0.48 % (14270)------------------------------
% 0.20/0.49 % (14278)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 % (14278)------------------------------
% 0.20/0.49 % (14278)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (14278)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (14278)Termination reason: Refutation
% 0.20/0.49
% 0.20/0.49 % (14278)Memory used [KB]: 1023
% 0.20/0.49 % (14278)Time elapsed: 0.056 s
% 0.20/0.49 % (14278)Instructions burned: 13 (million)
% 0.20/0.49 % (14278)------------------------------
% 0.20/0.49 % (14278)------------------------------
% 0.20/0.49 % (14262)Success in time 0.136 s
%------------------------------------------------------------------------------