TSTP Solution File: DAT104_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT104_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 : n023.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:11 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of formulae : 46 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 140 ( 38 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 165 ( 63 ~; 59 |; 35 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 146 ( 39 atm; 17 fun; 47 num; 43 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 : 12 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 88 ( 74 !; 14 ?; 88 :)
% 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_9,type,
sK0: ( $int * list ) > list ).
tff(func_def_10,type,
sK1: ( $int * list ) > $int ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(f132,plain,
$false,
inference(resolution,[],[f129,f45]) ).
tff(f45,plain,
! [X0: $int] : inRange(X0,nil),
inference(equality_resolution,[],[f40]) ).
tff(f40,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
| ( nil != X1 ) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: $int,X1: list] :
( ( inRange(X0,X1)
| ( ! [X2: list,X3: $int] :
( ~ $less(X3,X0)
| ( cons(X3,X2) != X1 )
| $less(X3,0)
| ~ inRange(X0,X2) )
& ( nil != X1 ) ) )
& ( ( $less(sK1(X0,X1),X0)
& ( cons(sK1(X0,X1),sK0(X0,X1)) = X1 )
& ~ $less(sK1(X0,X1),0)
& inRange(X0,sK0(X0,X1)) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f29,f30]) ).
tff(f30,plain,
! [X0: $int,X1: list] :
( ? [X4: list,X5: $int] :
( $less(X5,X0)
& ( cons(X5,X4) = X1 )
& ~ $less(X5,0)
& inRange(X0,X4) )
=> ( $less(sK1(X0,X1),X0)
& ( cons(sK1(X0,X1),sK0(X0,X1)) = X1 )
& ~ $less(sK1(X0,X1),0)
& inRange(X0,sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f29,plain,
! [X0: $int,X1: list] :
( ( inRange(X0,X1)
| ( ! [X2: list,X3: $int] :
( ~ $less(X3,X0)
| ( cons(X3,X2) != X1 )
| $less(X3,0)
| ~ inRange(X0,X2) )
& ( nil != X1 ) ) )
& ( ? [X4: list,X5: $int] :
( $less(X5,X0)
& ( cons(X5,X4) = X1 )
& ~ $less(X5,0)
& inRange(X0,X4) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(rectify,[],[f28]) ).
tff(f28,plain,
! [X0: $int,X1: list] :
( ( inRange(X0,X1)
| ( ! [X2: list,X3: $int] :
( ~ $less(X3,X0)
| ( cons(X3,X2) != X1 )
| $less(X3,0)
| ~ inRange(X0,X2) )
& ( nil != X1 ) ) )
& ( ? [X2: list,X3: $int] :
( $less(X3,X0)
& ( cons(X3,X2) = X1 )
& ~ $less(X3,0)
& inRange(X0,X2) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(flattening,[],[f27]) ).
tff(f27,plain,
! [X0: $int,X1: list] :
( ( inRange(X0,X1)
| ( ! [X2: list,X3: $int] :
( ~ $less(X3,X0)
| ( cons(X3,X2) != X1 )
| $less(X3,0)
| ~ inRange(X0,X2) )
& ( nil != X1 ) ) )
& ( ? [X2: list,X3: $int] :
( $less(X3,X0)
& ( cons(X3,X2) = X1 )
& ~ $less(X3,0)
& inRange(X0,X2) )
| ( nil = X1 )
| ~ inRange(X0,X1) ) ),
inference(nnf_transformation,[],[f22]) ).
tff(f22,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> ( ? [X2: list,X3: $int] :
( $less(X3,X0)
& ( cons(X3,X2) = X1 )
& ~ $less(X3,0)
& inRange(X0,X2) )
| ( nil = X1 ) ) ),
inference(rectify,[],[f8]) ).
tff(f8,plain,
! [X2: $int,X1: list] :
( ( ( nil = X1 )
| ? [X3: list,X0: $int] :
( ( cons(X0,X3) = X1 )
& ~ $less(X0,0)
& inRange(X2,X3)
& $less(X0,X2) ) )
<=> inRange(X2,X1) ),
inference(theory_normalization,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( ( ( nil = X1 )
| ? [X3: list,X0: $int] :
( ( cons(X0,X3) = X1 )
& $lesseq(0,X0)
& inRange(X2,X3)
& $less(X0,X2) ) )
<=> inRange(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(f129,plain,
! [X14: list] : ~ inRange(1,X14),
inference(evaluation,[],[f125]) ).
tff(f125,plain,
! [X14: list] :
( ~ $less(0,1)
| ~ inRange(1,X14) ),
inference(resolution,[],[f119,f15]) ).
tff(f15,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f119,plain,
! [X2: list,X1: $int] :
( $less(X1,0)
| ~ $less(X1,1)
| ~ inRange(1,X2) ),
inference(subsumption_resolution,[],[f117,f42]) ).
tff(f42,plain,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
inference(cnf_transformation,[],[f4]) ).
tff(f4,axiom,
! [X0: $int,X1: list] : ( cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).
tff(f117,plain,
! [X2: list,X1: $int] :
( ~ $less(X1,1)
| ( nil = cons(X1,X2) )
| $less(X1,0)
| ~ inRange(1,X2) ),
inference(resolution,[],[f114,f44]) ).
tff(f44,plain,
! [X2: list,X3: $int,X0: $int] :
( ~ inRange(X0,X2)
| inRange(X0,cons(X3,X2))
| $less(X3,0)
| ~ $less(X3,X0) ),
inference(equality_resolution,[],[f41]) ).
tff(f41,plain,
! [X2: list,X3: $int,X0: $int,X1: list] :
( inRange(X0,X1)
| ~ $less(X3,X0)
| ( cons(X3,X2) != X1 )
| $less(X3,0)
| ~ inRange(X0,X2) ),
inference(cnf_transformation,[],[f31]) ).
tff(f114,plain,
! [X0: list] :
( ~ inRange(1,X0)
| ( nil = X0 ) ),
inference(subsumption_resolution,[],[f113,f64]) ).
tff(f64,plain,
! [X5: list] :
( inRange(0,X5)
| ~ inRange(1,X5) ),
inference(evaluation,[],[f63]) ).
tff(f63,plain,
! [X5: list] :
( ~ inRange($uminus(-1),X5)
| inRange(0,X5) ),
inference(superposition,[],[f52,f14]) ).
tff(f14,plain,
! [X0: $int] : ( 0 = $sum(X0,$uminus(X0)) ),
introduced(theory_axiom_145,[]) ).
tff(f52,plain,
! [X0: $int,X1: list] :
( inRange($sum(-1,X0),X1)
| ~ inRange(X0,X1) ),
inference(superposition,[],[f46,f10]) ).
tff(f10,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f46,plain,
! [X0: $int,X1: list] :
( inRange($sum(X0,-1),X1)
| ~ inRange(X0,X1) ),
inference(evaluation,[],[f33]) ).
tff(f33,plain,
! [X0: $int,X1: list] :
( inRange($sum(X0,$uminus(1)),X1)
| ~ inRange(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: $int,X1: list] :
( inRange($sum(X0,$uminus(1)),X1)
| ~ inRange(X0,X1) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
=> inRange($sum(X0,$uminus(1)),X1) ),
inference(rectify,[],[f9]) ).
tff(f9,plain,
! [X2: $int,X1: list] :
( inRange(X2,X1)
=> inRange($sum(X2,$uminus(1)),X1) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,negated_conjecture,
~ ~ ! [X2: $int,X1: list] :
( inRange(X2,X1)
=> inRange($difference(X2,1),X1) ),
inference(negated_conjecture,[],[f6]) ).
tff(f6,conjecture,
~ ! [X2: $int,X1: list] :
( inRange(X2,X1)
=> inRange($difference(X2,1),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f113,plain,
! [X0: list] :
( ~ inRange(0,X0)
| ~ inRange(1,X0)
| ( nil = X0 ) ),
inference(duplicate_literal_removal,[],[f107]) ).
tff(f107,plain,
! [X0: list] :
( ( nil = X0 )
| ~ inRange(0,X0)
| ( nil = X0 )
| ~ inRange(1,X0) ),
inference(resolution,[],[f71,f39]) ).
tff(f39,plain,
! [X0: $int,X1: list] :
( $less(sK1(X0,X1),X0)
| ~ inRange(X0,X1)
| ( nil = X1 ) ),
inference(cnf_transformation,[],[f31]) ).
tff(f71,plain,
! [X1: list] :
( ~ $less(sK1(0,X1),0)
| ( nil = X1 )
| ~ inRange(1,X1) ),
inference(resolution,[],[f64,f37]) ).
tff(f37,plain,
! [X0: $int,X1: list] :
( ~ inRange(X0,X1)
| ~ $less(sK1(X0,X1),0)
| ( nil = X1 ) ),
inference(cnf_transformation,[],[f31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : DAT104=1 : TPTP v8.1.0. Released v6.1.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.13/0.34 % Computer : n023.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:43:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.48 % (4550)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.49 % (4552)lrs+10_1:32_s2a=on:s2agt=10:sgt=8:ss=axioms:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.50 % (4558)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.20/0.50 % (4558)Refutation not found, incomplete strategy% (4558)------------------------------
% 0.20/0.50 % (4558)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (4558)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (4558)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.50
% 0.20/0.50 % (4558)Memory used [KB]: 5500
% 0.20/0.50 % (4558)Time elapsed: 0.106 s
% 0.20/0.50 % (4558)Instructions burned: 2 (million)
% 0.20/0.50 % (4558)------------------------------
% 0.20/0.50 % (4558)------------------------------
% 0.20/0.50 % (4550)Instruction limit reached!
% 0.20/0.50 % (4550)------------------------------
% 0.20/0.50 % (4550)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (4550)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (4550)Termination reason: Unknown
% 0.20/0.50 % (4550)Termination phase: Saturation
% 0.20/0.50
% 0.20/0.50 % (4550)Memory used [KB]: 895
% 0.20/0.50 % (4550)Time elapsed: 0.003 s
% 0.20/0.50 % (4550)Instructions burned: 2 (million)
% 0.20/0.50 % (4550)------------------------------
% 0.20/0.50 % (4550)------------------------------
% 0.20/0.50 % (4551)ott+1011_1:2_br=off:bs=unit_only:bsr=unit_only:nwc=5.0:s2a=on:s2agt=32:urr=on:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.50 % (4566)lrs+10_1:1_sd=10:sos=all:ss=axioms:st=5.0:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (4566)Instruction limit reached!
% 0.20/0.50 % (4566)------------------------------
% 0.20/0.50 % (4566)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (4560)dis+10_1:64_nwc=1.4:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.50 % (4566)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (4566)Termination reason: Unknown
% 0.20/0.50 % (4566)Termination phase: Saturation
% 0.20/0.50
% 0.20/0.50 % (4566)Memory used [KB]: 5500
% 0.20/0.50 % (4566)Time elapsed: 0.003 s
% 0.20/0.50 % (4566)Instructions burned: 2 (million)
% 0.20/0.50 % (4566)------------------------------
% 0.20/0.50 % (4566)------------------------------
% 0.20/0.50 % (4562)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.20/0.50 % (4562)Instruction limit reached!
% 0.20/0.50 % (4562)------------------------------
% 0.20/0.50 % (4562)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (4562)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (4562)Termination reason: Unknown
% 0.20/0.50 % (4562)Termination phase: Property scanning
% 0.20/0.50
% 0.20/0.50 % (4562)Memory used [KB]: 895
% 0.20/0.50 % (4562)Time elapsed: 0.002 s
% 0.20/0.50 % (4562)Instructions burned: 2 (million)
% 0.20/0.50 % (4562)------------------------------
% 0.20/0.50 % (4562)------------------------------
% 0.20/0.51 % (4569)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.20/0.51 % (4549)dis+1011_1:64_drc=off:flr=on:nwc=2.0:sac=on:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.51 % (4567)dis+1002_1:5_av=off:nwc=2.0:sos=all:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.51 % (4576)dis+1011_1:1_bd=off:canc=force:ev=cautious:nwc=5.0:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.20/0.51 % (4555)lrs+1010_1:1_ep=RST:s2a=on:s2at=5.0:sos=all:i=26:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/26Mi)
% 0.20/0.51 % (4553)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.20/0.51 % (4559)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.51 % (4559)Instruction limit reached!
% 0.20/0.51 % (4559)------------------------------
% 0.20/0.51 % (4559)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (4571)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.20/0.52 % (4559)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (4559)Termination reason: Unknown
% 0.20/0.52 % (4559)Termination phase: Including theory axioms
% 0.20/0.52
% 0.20/0.52 % (4559)Memory used [KB]: 895
% 0.20/0.52 % (4559)Time elapsed: 0.003 s
% 0.20/0.52 % (4559)Instructions burned: 2 (million)
% 0.20/0.52 % (4559)------------------------------
% 0.20/0.52 % (4559)------------------------------
% 0.20/0.52 % (4571)Refutation not found, incomplete strategy% (4571)------------------------------
% 0.20/0.52 % (4571)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (4571)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (4571)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.52
% 0.20/0.52 % (4571)Memory used [KB]: 5500
% 0.20/0.52 % (4571)Time elapsed: 0.084 s
% 0.20/0.52 % (4571)Instructions burned: 3 (million)
% 0.20/0.52 % (4571)------------------------------
% 0.20/0.52 % (4571)------------------------------
% 0.20/0.52 % (4567)First to succeed.
% 0.20/0.52 % (4552)Instruction limit reached!
% 0.20/0.52 % (4552)------------------------------
% 0.20/0.52 % (4552)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (4552)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (4552)Termination reason: Unknown
% 0.20/0.52 % (4552)Termination phase: Saturation
% 0.20/0.52
% 0.20/0.52 % (4552)Memory used [KB]: 5628
% 0.20/0.52 % (4552)Time elapsed: 0.105 s
% 0.20/0.52 % (4552)Instructions burned: 15 (million)
% 0.20/0.52 % (4552)------------------------------
% 0.20/0.52 % (4552)------------------------------
% 0.20/0.52 % (4567)Refutation found. Thanks to Tanya!
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52 % (4567)------------------------------
% 0.20/0.52 % (4567)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (4567)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (4567)Termination reason: Refutation
% 0.20/0.52
% 0.20/0.52 % (4567)Memory used [KB]: 1023
% 0.20/0.52 % (4567)Time elapsed: 0.128 s
% 0.20/0.52 % (4567)Instructions burned: 7 (million)
% 0.20/0.52 % (4567)------------------------------
% 0.20/0.52 % (4567)------------------------------
% 0.20/0.52 % (4544)Success in time 0.167 s
%------------------------------------------------------------------------------