TSTP Solution File: DAT098_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT098_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_uns --cores 0 -t %d %s
% Computer : n018.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:10 EDT 2022
% Result : Theorem 0.14s 0.48s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 11
% Syntax : Number of formulae : 31 ( 9 unt; 8 typ; 0 def)
% Number of atoms : 103 ( 26 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 126 ( 46 ~; 41 |; 35 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 116 ( 36 atm; 0 fun; 55 num; 25 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 48 ( 34 !; 14 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
list: $tType ).
tff(func_def_0,type,
nil: list ).
tff(func_def_1,type,
cons: ( $int * list ) > list ).
tff(func_def_2,type,
head: list > $int ).
tff(func_def_3,type,
tail: list > list ).
tff(func_def_11,type,
sK0: ( list * $int ) > list ).
tff(func_def_12,type,
sK1: ( list * $int ) > $int ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(f52,plain,
$false,
inference(subsumption_resolution,[],[f51,f44]) ).
tff(f44,plain,
! [X1: $int] : inRange(X1,nil),
inference(equality_resolution,[],[f37]) ).
tff(f37,plain,
! [X0: list,X1: $int] :
( inRange(X1,X0)
| ( nil != X0 ) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: list,X1: $int] :
( ( ( nil = X0 )
| ( ( cons(sK1(X0,X1),sK0(X0,X1)) = X0 )
& inRange(X1,sK0(X0,X1))
& $less(sK1(X0,X1),X1)
& ~ $less(sK1(X0,X1),0) )
| ~ inRange(X1,X0) )
& ( inRange(X1,X0)
| ( ( nil != X0 )
& ! [X4: list,X5: $int] :
( ( cons(X5,X4) != X0 )
| ~ inRange(X1,X4)
| ~ $less(X5,X1)
| $less(X5,0) ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f29,f30]) ).
tff(f30,plain,
! [X0: list,X1: $int] :
( ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& inRange(X1,X2)
& $less(X3,X1)
& ~ $less(X3,0) )
=> ( ( cons(sK1(X0,X1),sK0(X0,X1)) = X0 )
& inRange(X1,sK0(X0,X1))
& $less(sK1(X0,X1),X1)
& ~ $less(sK1(X0,X1),0) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
! [X0: list,X1: $int] :
( ( ( nil = X0 )
| ? [X2: list,X3: $int] :
( ( cons(X3,X2) = X0 )
& inRange(X1,X2)
& $less(X3,X1)
& ~ $less(X3,0) )
| ~ inRange(X1,X0) )
& ( inRange(X1,X0)
| ( ( nil != X0 )
& ! [X4: list,X5: $int] :
( ( cons(X5,X4) != X0 )
| ~ inRange(X1,X4)
| ~ $less(X5,X1)
| $less(X5,0) ) ) ) ),
inference(rectify,[],[f28]) ).
tff(f28,plain,
! [X1: list,X0: $int] :
( ( ( nil = X1 )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0) )
| ~ inRange(X0,X1) )
& ( inRange(X0,X1)
| ( ( nil != X1 )
& ! [X3: list,X2: $int] :
( ( cons(X2,X3) != X1 )
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0) ) ) ) ),
inference(flattening,[],[f27]) ).
tff(f27,plain,
! [X1: list,X0: $int] :
( ( ( nil = X1 )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0) )
| ~ inRange(X0,X1) )
& ( inRange(X0,X1)
| ( ( nil != X1 )
& ! [X3: list,X2: $int] :
( ( cons(X2,X3) != X1 )
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0) ) ) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X1: list,X0: $int] :
( ( ( nil = X1 )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0) ) )
<=> inRange(X0,X1) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
! [X2: $int,X1: list] :
( inRange(X2,X1)
<=> ( ? [X0: $int,X3: list] :
( inRange(X2,X3)
& $less(X0,X2)
& ~ $less(X0,0)
& ( cons(X0,X3) = X1 ) )
| ( nil = X1 ) ) ),
inference(theory_normalization,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( inRange(X2,X1)
<=> ( ? [X0: $int,X3: list] :
( inRange(X2,X3)
& $less(X0,X2)
& $lesseq(0,X0)
& ( cons(X0,X3) = X1 ) )
| ( nil = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f51,plain,
~ inRange(4,nil),
inference(evaluation,[],[f50]) ).
tff(f50,plain,
( ~ inRange(4,nil)
| ~ $less(2,4)
| $less(2,0) ),
inference(resolution,[],[f49,f45]) ).
tff(f45,plain,
! [X1: $int,X4: list,X5: $int] :
( inRange(X1,cons(X5,X4))
| ~ inRange(X1,X4)
| ~ $less(X5,X1)
| $less(X5,0) ),
inference(equality_resolution,[],[f36]) ).
tff(f36,plain,
! [X0: list,X1: $int,X4: list,X5: $int] :
( inRange(X1,X0)
| ( cons(X5,X4) != X0 )
| ~ inRange(X1,X4)
| ~ $less(X5,X1)
| $less(X5,0) ),
inference(cnf_transformation,[],[f31]) ).
tff(f49,plain,
~ inRange(4,cons(2,nil)),
inference(evaluation,[],[f48]) ).
tff(f48,plain,
( $less(3,0)
| ~ inRange(4,cons(2,nil))
| ~ $less(3,4) ),
inference(resolution,[],[f47,f45]) ).
tff(f47,plain,
~ inRange(4,cons(3,cons(2,nil))),
inference(evaluation,[],[f46]) ).
tff(f46,plain,
( ~ inRange(4,cons(3,cons(2,nil)))
| ~ $less(1,4)
| $less(1,0) ),
inference(resolution,[],[f43,f45]) ).
tff(f43,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(cnf_transformation,[],[f23]) ).
tff(f23,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(flattening,[],[f7]) ).
tff(f7,negated_conjecture,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
inRange(4,cons(1,cons(3,cons(2,nil)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : DAT098=1 : TPTP v8.1.0. Released v6.1.0.
% 0.02/0.10 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.09/0.29 % Computer : n018.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Aug 29 20:25:54 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.46 % (26890)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.14/0.47 % (26882)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.14/0.47 % (26890)Refutation not found, incomplete strategy% (26890)------------------------------
% 0.14/0.47 % (26890)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.47 % (26882)Instruction limit reached!
% 0.14/0.47 % (26882)------------------------------
% 0.14/0.47 % (26882)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.47 % (26882)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.47 % (26882)Termination reason: Unknown
% 0.14/0.47 % (26882)Termination phase: Property scanning
% 0.14/0.47
% 0.14/0.47 % (26882)Memory used [KB]: 895
% 0.14/0.47 % (26882)Time elapsed: 0.005 s
% 0.14/0.47 % (26882)Instructions burned: 2 (million)
% 0.14/0.47 % (26882)------------------------------
% 0.14/0.47 % (26882)------------------------------
% 0.14/0.47 % (26890)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.47 % (26890)Termination reason: Refutation not found, incomplete strategy
% 0.14/0.47
% 0.14/0.47 % (26890)Memory used [KB]: 5500
% 0.14/0.47 % (26890)Time elapsed: 0.054 s
% 0.14/0.47 % (26890)Instructions burned: 3 (million)
% 0.14/0.47 % (26890)------------------------------
% 0.14/0.47 % (26890)------------------------------
% 0.14/0.47 % (26896)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=41:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/41Mi)
% 0.14/0.47 % (26888)dis+10_1:64_nwc=1.4:rp=on:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.14/0.47 % (26874)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.14/0.47 % (26874)First to succeed.
% 0.14/0.47 % (26880)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.14/0.48 % (26874)Refutation found. Thanks to Tanya!
% 0.14/0.48 % SZS status Theorem for theBenchmark
% 0.14/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.48 % (26874)------------------------------
% 0.14/0.48 % (26874)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.48 % (26874)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.48 % (26874)Termination reason: Refutation
% 0.14/0.48
% 0.14/0.48 % (26874)Memory used [KB]: 5500
% 0.14/0.48 % (26874)Time elapsed: 0.064 s
% 0.14/0.48 % (26874)Instructions burned: 2 (million)
% 0.14/0.48 % (26874)------------------------------
% 0.14/0.48 % (26874)------------------------------
% 0.14/0.48 % (26866)Success in time 0.172 s
%------------------------------------------------------------------------------