TSTP Solution File: DAT008_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT008_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_uns --cores 0 -t %d %s
% Computer : n016.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:03:53 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 69 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 52 ( 17 ~; 13 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 144 ( 29 atm; 0 fun; 72 num; 43 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 5 usr; 7 con; 0-3 aty)
% Number of variables : 67 ( 53 !; 14 ?; 67 :)
% 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_10,type,
sK0: array ).
tff(func_def_11,type,
sK1: array ).
tff(func_def_12,type,
sK2: $int ).
tff(f131,plain,
$false,
inference(evaluation,[],[f130]) ).
tff(f130,plain,
~ $less(3,5),
inference(forward_demodulation,[],[f124,f70]) ).
tff(f70,plain,
5 = read(sK1,3),
inference(evaluation,[],[f69]) ).
tff(f69,plain,
( ( 5 = read(sK1,3) )
| ( 3 = 7 ) ),
inference(superposition,[],[f32,f44]) ).
tff(f44,plain,
! [X0: $int] :
( ( read(sK1,X0) = read(write(sK0,3,5),X0) )
| ( 7 = X0 ) ),
inference(superposition,[],[f33,f29]) ).
tff(f29,plain,
sK1 = write(write(sK0,3,5),7,9),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
( ~ $less(sK2,read(sK1,sK2))
& ! [X3: $int] : $less(X3,read(sK0,X3))
& ( sK1 = write(write(sK0,3,5),7,9) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f23,f25,f24]) ).
tff(f24,plain,
( ? [X0: array,X1: array] :
( ? [X2: $int] : ~ $less(X2,read(X1,X2))
& ! [X3: $int] : $less(X3,read(X0,X3))
& ( write(write(X0,3,5),7,9) = X1 ) )
=> ( ? [X2: $int] : ~ $less(X2,read(sK1,X2))
& ! [X3: $int] : $less(X3,read(sK0,X3))
& ( sK1 = write(write(sK0,3,5),7,9) ) ) ),
introduced(choice_axiom,[]) ).
tff(f25,plain,
( ? [X2: $int] : ~ $less(X2,read(sK1,X2))
=> ~ $less(sK2,read(sK1,sK2)) ),
introduced(choice_axiom,[]) ).
tff(f23,plain,
? [X0: array,X1: array] :
( ? [X2: $int] : ~ $less(X2,read(X1,X2))
& ! [X3: $int] : $less(X3,read(X0,X3))
& ( write(write(X0,3,5),7,9) = X1 ) ),
inference(rectify,[],[f22]) ).
tff(f22,plain,
? [X0: array,X1: array] :
( ? [X3: $int] : ~ $less(X3,read(X1,X3))
& ! [X2: $int] : $less(X2,read(X0,X2))
& ( write(write(X0,3,5),7,9) = X1 ) ),
inference(flattening,[],[f21]) ).
tff(f21,plain,
? [X0: array,X1: array] :
( ? [X3: $int] : ~ $less(X3,read(X1,X3))
& ( write(write(X0,3,5),7,9) = X1 )
& ! [X2: $int] : $less(X2,read(X0,X2)) ),
inference(ennf_transformation,[],[f18]) ).
tff(f18,plain,
~ ! [X0: array,X1: array] :
( ( ( write(write(X0,3,5),7,9) = X1 )
& ! [X2: $int] : $less(X2,read(X0,X2)) )
=> ! [X3: $int] : $less(X3,read(X1,X3)) ),
inference(rectify,[],[f5]) ).
tff(f5,plain,
~ ! [X1: array,X0: array] :
( ( ! [X2: $int] : $less(X2,read(X1,X2))
& ( write(write(X1,3,5),7,9) = X0 ) )
=> ! [X3: $int] : $less(X3,read(X0,X3)) ),
inference(theory_normalization,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X1: array,X0: array] :
( ( ! [X2: $int] : $greater(read(X1,X2),X2)
& ( write(write(X1,3,5),7,9) = X0 ) )
=> ! [X3: $int] : $greater(read(X0,X3),X3) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X1: array,X0: array] :
( ( ! [X2: $int] : $greater(read(X1,X2),X2)
& ( write(write(X1,3,5),7,9) = X0 ) )
=> ! [X3: $int] : $greater(read(X0,X3),X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f33,plain,
! [X2: $int,X3: array,X0: $int,X1: $int] :
( ( read(X3,X0) = read(write(X3,X2,X1),X0) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f28]) ).
tff(f28,plain,
! [X0: $int,X1: $int,X2: $int,X3: array] :
( ( read(X3,X0) = read(write(X3,X2,X1),X0) )
| ( X0 = X2 ) ),
inference(rectify,[],[f20]) ).
tff(f20,plain,
! [X1: $int,X2: $int,X3: $int,X0: array] :
( ( read(write(X0,X3,X2),X1) = read(X0,X1) )
| ( X1 = X3 ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X3: array,X5: $int,X6: $int,X4: $int] :
( ( X4 = X5 )
| ( read(write(X3,X4,X6),X5) = read(X3,X5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(f32,plain,
! [X2: $int,X0: array,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(cnf_transformation,[],[f27]) ).
tff(f27,plain,
! [X0: array,X1: $int,X2: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
inference(rectify,[],[f19]) ).
tff(f19,plain,
! [X0: array,X2: $int,X1: $int] : ( read(write(X0,X2,X1),X2) = X1 ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X0: array,X2: $int,X1: $int] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f124,plain,
~ $less(3,read(sK1,3)),
inference(backward_demodulation,[],[f31,f118]) ).
tff(f118,plain,
3 = sK2,
inference(evaluation,[],[f117]) ).
tff(f117,plain,
( ~ $less(7,9)
| ( 3 = sK2 ) ),
inference(forward_demodulation,[],[f115,f43]) ).
tff(f43,plain,
9 = read(sK1,7),
inference(superposition,[],[f32,f29]) ).
tff(f115,plain,
( ~ $less(7,read(sK1,7))
| ( 3 = sK2 ) ),
inference(superposition,[],[f31,f111]) ).
tff(f111,plain,
( ( 7 = sK2 )
| ( 3 = sK2 ) ),
inference(subsumption_resolution,[],[f110,f30]) ).
tff(f30,plain,
! [X3: $int] : $less(X3,read(sK0,X3)),
inference(cnf_transformation,[],[f26]) ).
tff(f110,plain,
( ( 7 = sK2 )
| ~ $less(sK2,read(sK0,sK2))
| ( 3 = sK2 ) ),
inference(superposition,[],[f31,f66]) ).
tff(f66,plain,
! [X1: $int] :
( ( read(sK1,X1) = read(sK0,X1) )
| ( 7 = X1 )
| ( 3 = X1 ) ),
inference(superposition,[],[f44,f33]) ).
tff(f31,plain,
~ $less(sK2,read(sK1,sK2)),
inference(cnf_transformation,[],[f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : DAT008=1 : TPTP v8.1.0. Released v5.0.0.
% 0.04/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.12/0.33 % Computer : n016.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:38:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.54 % (26401)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=32:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/32Mi)
% 0.19/0.55 % (26417)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.19/0.55 % (26410)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.19/0.56 % (26417)First to succeed.
% 0.19/0.56 % (26410)Instruction limit reached!
% 0.19/0.56 % (26410)------------------------------
% 0.19/0.56 % (26410)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (26410)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (26410)Termination reason: Unknown
% 0.19/0.56 % (26410)Termination phase: Saturation
% 0.19/0.56
% 0.19/0.56 % (26410)Memory used [KB]: 5373
% 0.19/0.56 % (26410)Time elapsed: 0.004 s
% 0.19/0.56 % (26410)Instructions burned: 2 (million)
% 0.19/0.56 % (26410)------------------------------
% 0.19/0.56 % (26410)------------------------------
% 0.19/0.56 % (26402)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.19/0.56 % (26417)Refutation found. Thanks to Tanya!
% 0.19/0.56 % SZS status Theorem for theBenchmark
% 0.19/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.56 % (26417)------------------------------
% 0.19/0.56 % (26417)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.56 % (26417)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.56 % (26417)Termination reason: Refutation
% 0.19/0.56
% 0.19/0.56 % (26417)Memory used [KB]: 1023
% 0.19/0.56 % (26417)Time elapsed: 0.144 s
% 0.19/0.56 % (26417)Instructions burned: 7 (million)
% 0.19/0.56 % (26417)------------------------------
% 0.19/0.56 % (26417)------------------------------
% 0.19/0.56 % (26394)Success in time 0.218 s
%------------------------------------------------------------------------------