TSTP Solution File: DAT007_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT007_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 : 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:03:53 EDT 2022
% Result : Theorem 0.21s 0.50s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of formulae : 31 ( 6 unt; 5 typ; 0 def)
% Number of atoms : 64 ( 39 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 54 ( 16 ~; 26 |; 8 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 187 ( 24 atm; 0 fun; 129 num; 34 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 4 usr; 11 con; 0-3 aty)
% Number of variables : 53 ( 44 !; 9 ?; 53 :)
% 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_15,type,
sK0: array ).
tff(func_def_16,type,
sK1: array ).
tff(f66,plain,
$false,
inference(evaluation,[],[f64]) ).
tff(f64,plain,
( ( 33 = 40 )
| $less(40,33)
| ~ $less(30,33) ),
inference(superposition,[],[f29,f61]) ).
tff(f61,plain,
33 = read(sK0,3),
inference(evaluation,[],[f60]) ).
tff(f60,plain,
( ( 3 = 5 )
| ( 3 = 4 )
| ( 33 = read(sK0,3) ) ),
inference(superposition,[],[f28,f49]) ).
tff(f49,plain,
! [X1: $int] :
( ( read(write(sK1,3,33),X1) = read(sK0,X1) )
| ( 5 = X1 )
| ( 4 = X1 ) ),
inference(duplicate_literal_removal,[],[f45]) ).
tff(f45,plain,
! [X1: $int] :
( ( 5 = X1 )
| ( read(write(sK1,3,33),X1) = read(sK0,X1) )
| ( 4 = X1 )
| ( 4 = X1 ) ),
inference(superposition,[],[f37,f25]) ).
tff(f25,plain,
! [X2: $int,X3: $int,X0: $int,X1: array] :
( ( read(X1,X0) = read(write(X1,X2,X3),X0) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f21]) ).
tff(f21,plain,
! [X0: $int,X1: array,X2: $int,X3: $int] :
( ( X0 = X2 )
| ( read(X1,X0) = read(write(X1,X2,X3),X0) ) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X3: $int,X1: array,X0: $int,X2: $int] :
( ( X0 = X3 )
| ( read(X1,X3) = read(write(X1,X0,X2),X3) ) ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X4: $int,X3: array,X6: $int,X5: $int] :
( ( read(write(X3,X4,X6),X5) = read(X3,X5) )
| ( X4 = X5 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f37,plain,
! [X1: $int] :
( ( read(write(write(sK1,3,33),4,444),X1) = read(sK0,X1) )
| ( 4 = X1 )
| ( 5 = X1 ) ),
inference(superposition,[],[f32,f25]) ).
tff(f32,plain,
! [X0: $int] :
( ( read(sK0,X0) = read(write(write(write(sK1,3,33),4,444),5,55),X0) )
| ( 4 = X0 ) ),
inference(superposition,[],[f25,f26]) ).
tff(f26,plain,
write(write(write(write(sK1,3,33),4,444),5,55),4,44) = sK0,
inference(cnf_transformation,[],[f24]) ).
tff(f24,plain,
( ! [X2: $int] :
( ~ $less(read(sK0,X2),40)
| ~ $less(30,read(sK0,X2)) )
& ( write(write(write(write(sK1,3,33),4,444),5,55),4,44) = sK0 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f22,f23]) ).
tff(f23,plain,
( ? [X0: array,X1: array] :
( ! [X2: $int] :
( ~ $less(read(X0,X2),40)
| ~ $less(30,read(X0,X2)) )
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) )
=> ( ! [X2: $int] :
( ~ $less(read(sK0,X2),40)
| ~ $less(30,read(sK0,X2)) )
& ( write(write(write(write(sK1,3,33),4,444),5,55),4,44) = sK0 ) ) ),
introduced(choice_axiom,[]) ).
tff(f22,plain,
? [X0: array,X1: array] :
( ! [X2: $int] :
( ~ $less(read(X0,X2),40)
| ~ $less(30,read(X0,X2)) )
& ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 ) ),
inference(rectify,[],[f20]) ).
tff(f20,plain,
? [X1: array,X0: array] :
( ! [X2: $int] :
( ~ $less(read(X1,X2),40)
| ~ $less(30,read(X1,X2)) )
& ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 ) ),
inference(ennf_transformation,[],[f17]) ).
tff(f17,plain,
~ ! [X1: array,X0: array] :
( ( write(write(write(write(X0,3,33),4,444),5,55),4,44) = X1 )
=> ? [X2: $int] :
( $less(30,read(X1,X2))
& $less(read(X1,X2),40) ) ),
inference(rectify,[],[f4]) ).
tff(f4,negated_conjecture,
~ ! [X1: array,X0: array] :
( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
=> ? [X2: $int] :
( $less(read(X0,X2),40)
& $less(30,read(X0,X2)) ) ),
inference(negated_conjecture,[],[f3]) ).
tff(f3,conjecture,
! [X1: array,X0: array] :
( ( write(write(write(write(X1,3,33),4,444),5,55),4,44) = X0 )
=> ? [X2: $int] :
( $less(read(X0,X2),40)
& $less(30,read(X0,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f28,plain,
! [X2: array,X0: $int,X1: $int] : ( read(write(X2,X1,X0),X1) = X0 ),
inference(cnf_transformation,[],[f19]) ).
tff(f19,plain,
! [X0: $int,X1: $int,X2: array] : ( read(write(X2,X1,X0),X1) = X0 ),
inference(rectify,[],[f1]) ).
tff(f1,axiom,
! [X2: $int,X1: $int,X0: array] : ( read(write(X0,X1,X2),X1) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(f29,plain,
! [X0: $int] :
( ~ $less(30,read(sK0,X0))
| ( 40 = read(sK0,X0) )
| $less(40,read(sK0,X0)) ),
inference(resolution,[],[f27,f12]) ).
tff(f12,plain,
! [X0: $int,X1: $int] :
( $less(X1,X0)
| $less(X0,X1)
| ( X0 = X1 ) ),
introduced(theory_axiom_149,[]) ).
tff(f27,plain,
! [X2: $int] :
( ~ $less(read(sK0,X2),40)
| ~ $less(30,read(sK0,X2)) ),
inference(cnf_transformation,[],[f24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : DAT007=1 : TPTP v8.1.0. Released v5.0.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 29 20:18:00 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.48 % (11392)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.21/0.49 % (11392)Instruction limit reached!
% 0.21/0.49 % (11392)------------------------------
% 0.21/0.49 % (11392)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (11392)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.49 % (11392)Termination reason: Unknown
% 0.21/0.49 % (11392)Termination phase: Preprocessing 3
% 0.21/0.49
% 0.21/0.49 % (11392)Memory used [KB]: 895
% 0.21/0.49 % (11392)Time elapsed: 0.004 s
% 0.21/0.49 % (11392)Instructions burned: 2 (million)
% 0.21/0.49 % (11392)------------------------------
% 0.21/0.49 % (11392)------------------------------
% 0.21/0.49 % (11400)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.21/0.50 % (11400)First to succeed.
% 0.21/0.50 % (11400)Refutation found. Thanks to Tanya!
% 0.21/0.50 % SZS status Theorem for theBenchmark
% 0.21/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.50 % (11400)------------------------------
% 0.21/0.50 % (11400)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (11400)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (11400)Termination reason: Refutation
% 0.21/0.50
% 0.21/0.50 % (11400)Memory used [KB]: 5500
% 0.21/0.50 % (11400)Time elapsed: 0.082 s
% 0.21/0.50 % (11400)Instructions burned: 4 (million)
% 0.21/0.50 % (11400)------------------------------
% 0.21/0.50 % (11400)------------------------------
% 0.21/0.50 % (11376)Success in time 0.143 s
%------------------------------------------------------------------------------