TSTP Solution File: DAT089_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT089_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_sat --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:04:52 EDT 2022
% Result : Theorem 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 25
% Syntax : Number of formulae : 61 ( 22 unt; 16 typ; 0 def)
% Number of atoms : 115 ( 60 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 113 ( 43 ~; 35 |; 26 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 129 ( 21 atm; 6 fun; 25 num; 77 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 7 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 131 ( 107 !; 24 ?; 131 :)
% 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_5,type,
length: list > $int ).
tff(func_def_8,type,
count: ( $int * list ) > $int ).
tff(func_def_9,type,
append: ( list * list ) > list ).
tff(func_def_11,type,
sK0: ( list * $int ) > $int ).
tff(func_def_12,type,
sK1: ( list * $int ) > list ).
tff(func_def_13,type,
sK2: ( list * $int ) > list ).
tff(func_def_14,type,
sK3: ( list * $int ) > $int ).
tff(func_def_15,type,
sK4: ( $int * list ) > list ).
tff(func_def_16,type,
sK5: ( $int * list ) > $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f308,plain,
$false,
inference(subsumption_resolution,[],[f307,f287]) ).
tff(f287,plain,
! [X0: $int,X1: $int] : ~ $less(X1,X0),
inference(superposition,[],[f265,f175]) ).
tff(f175,plain,
! [X3: $int,X4: $int] : ( X3 = X4 ),
inference(evaluation,[],[f174]) ).
tff(f174,plain,
! [X3: $int,X4: $int] :
( ~ $less(0,1)
| ( X3 = X4 ) ),
inference(forward_demodulation,[],[f168,f86]) ).
tff(f86,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: $int] : ( 0 = count(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a) ).
tff(f168,plain,
! [X3: $int,X4: $int] :
( ( X3 = X4 )
| ~ $less(count(X3,nil),1) ),
inference(superposition,[],[f136,f85]) ).
tff(f85,plain,
! [X2: list,X0: $int,X1: $int] :
( ( count(X1,cons(X0,X2)) = count(X1,X2) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f61]) ).
tff(f61,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 = X1 )
| ( count(X1,cons(X0,X2)) = count(X1,X2) ) ),
inference(rectify,[],[f46]) ).
tff(f46,plain,
! [X2: $int,X1: $int,X3: list] :
( ( X1 = X2 )
| ( count(X1,X3) = count(X1,cons(X2,X3)) ) ),
inference(ennf_transformation,[],[f41]) ).
tff(f41,plain,
! [X1: $int,X3: list,X2: $int] :
( ( X1 != X2 )
=> ( count(X1,X3) = count(X1,cons(X2,X3)) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X5: $int,X0: $int,X3: $int,X4: list] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_3) ).
tff(f136,plain,
! [X0: $int,X1: $int] : ~ $less(count(X0,cons(X1,nil)),1),
inference(evaluation,[],[f133]) ).
tff(f133,plain,
! [X0: $int,X1: $int] : ~ $less(count(X0,cons(X1,nil)),$sum(1,0)),
inference(superposition,[],[f122,f84]) ).
tff(f84,plain,
0 = length(nil),
inference(cnf_transformation,[],[f7]) ).
tff(f7,axiom,
0 = length(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(f122,plain,
! [X8: list,X9: $int,X7: $int] : ~ $less(count(X9,cons(X7,X8)),$sum(1,length(X8))),
inference(superposition,[],[f83,f65]) ).
tff(f65,plain,
! [X0: $int,X1: list] : ( $sum(1,length(X1)) = length(cons(X0,X1)) ),
inference(cnf_transformation,[],[f47]) ).
tff(f47,plain,
! [X0: $int,X1: list] : ( $sum(1,length(X1)) = length(cons(X0,X1)) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
! [X1: $int,X0: list] : ( length(cons(X1,X0)) = $sum(1,length(X0)) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X4: list,X3: $int] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1) ).
tff(f83,plain,
! [X0: list,X1: $int] : ~ $less(count(X1,X0),length(X0)),
inference(cnf_transformation,[],[f40]) ).
tff(f40,plain,
! [X0: list,X1: $int] : ~ $less(count(X1,X0),length(X0)),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X1: list,X5: $int] : ~ $less(count(X5,X1),length(X1)),
inference(theory_normalization,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X1: list,X5: $int] : $greatereq(count(X5,X1),length(X1)),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X1: list,X5: $int] : $greatereq(count(X5,X1),length(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f265,plain,
! [X2: $int] : ~ $less(X2,1),
inference(superposition,[],[f136,f175]) ).
tff(f307,plain,
! [X0: $int,X1: list] : $less(0,count(X0,cons(X0,X1))),
inference(resolution,[],[f88,f93]) ).
tff(f93,plain,
! [X4: list,X5: $int] : in(X5,cons(X5,X4)),
inference(equality_resolution,[],[f92]) ).
tff(f92,plain,
! [X1: $int,X4: list,X5: $int] :
( in(X1,cons(X5,X4))
| ( X1 != X5 ) ),
inference(equality_resolution,[],[f70]) ).
tff(f70,plain,
! [X0: list,X1: $int,X4: list,X5: $int] :
( in(X1,X0)
| ( cons(X5,X4) != X0 )
| ( X1 != X5 ) ),
inference(cnf_transformation,[],[f53]) ).
tff(f53,plain,
! [X0: list,X1: $int] :
( ( in(X1,X0)
| ( ! [X2: $int,X3: list] :
( ( cons(X2,X3) != X0 )
| ~ in(X1,X3) )
& ! [X4: list,X5: $int] :
( ( cons(X5,X4) != X0 )
| ( X1 != X5 ) ) ) )
& ( ( ( cons(sK0(X0,X1),sK1(X0,X1)) = X0 )
& in(X1,sK1(X0,X1)) )
| ( ( cons(sK3(X0,X1),sK2(X0,X1)) = X0 )
& ( sK3(X0,X1) = X1 ) )
| ~ in(X1,X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f50,f52,f51]) ).
tff(f51,plain,
! [X0: list,X1: $int] :
( ? [X6: $int,X7: list] :
( ( cons(X6,X7) = X0 )
& in(X1,X7) )
=> ( ( cons(sK0(X0,X1),sK1(X0,X1)) = X0 )
& in(X1,sK1(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
tff(f52,plain,
! [X0: list,X1: $int] :
( ? [X8: list,X9: $int] :
( ( cons(X9,X8) = X0 )
& ( X1 = X9 ) )
=> ( ( cons(sK3(X0,X1),sK2(X0,X1)) = X0 )
& ( sK3(X0,X1) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f50,plain,
! [X0: list,X1: $int] :
( ( in(X1,X0)
| ( ! [X2: $int,X3: list] :
( ( cons(X2,X3) != X0 )
| ~ in(X1,X3) )
& ! [X4: list,X5: $int] :
( ( cons(X5,X4) != X0 )
| ( X1 != X5 ) ) ) )
& ( ? [X6: $int,X7: list] :
( ( cons(X6,X7) = X0 )
& in(X1,X7) )
| ? [X8: list,X9: $int] :
( ( cons(X9,X8) = X0 )
& ( X1 = X9 ) )
| ~ in(X1,X0) ) ),
inference(rectify,[],[f49]) ).
tff(f49,plain,
! [X1: list,X0: $int] :
( ( in(X0,X1)
| ( ! [X5: $int,X4: list] :
( ( cons(X5,X4) != X1 )
| ~ in(X0,X4) )
& ! [X3: list,X2: $int] :
( ( cons(X2,X3) != X1 )
| ( X0 != X2 ) ) ) )
& ( ? [X5: $int,X4: list] :
( ( cons(X5,X4) = X1 )
& in(X0,X4) )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& ( X0 = X2 ) )
| ~ in(X0,X1) ) ),
inference(flattening,[],[f48]) ).
tff(f48,plain,
! [X1: list,X0: $int] :
( ( in(X0,X1)
| ( ! [X5: $int,X4: list] :
( ( cons(X5,X4) != X1 )
| ~ in(X0,X4) )
& ! [X3: list,X2: $int] :
( ( cons(X2,X3) != X1 )
| ( X0 != X2 ) ) ) )
& ( ? [X5: $int,X4: list] :
( ( cons(X5,X4) = X1 )
& in(X0,X4) )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& ( X0 = X2 ) )
| ~ in(X0,X1) ) ),
inference(nnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X1: list,X0: $int] :
( in(X0,X1)
<=> ( ? [X5: $int,X4: list] :
( ( cons(X5,X4) = X1 )
& in(X0,X4) )
| ? [X3: list,X2: $int] :
( ( cons(X2,X3) = X1 )
& ( X0 = X2 ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( ( ? [X3: $int,X4: list] :
( ( X2 = X3 )
& ( cons(X3,X4) = X1 ) )
| ? [X4: list,X3: $int] :
( in(X2,X4)
& ( cons(X3,X4) = X1 ) ) )
<=> in(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_conv) ).
tff(f88,plain,
! [X0: $int,X1: list] :
( ~ in(X0,X1)
| $less(0,count(X0,X1)) ),
inference(cnf_transformation,[],[f63]) ).
tff(f63,plain,
! [X0: $int,X1: list] :
( ( $less(0,count(X0,X1))
| ~ in(X0,X1) )
& ( in(X0,X1)
| ~ $less(0,count(X0,X1)) ) ),
inference(rectify,[],[f62]) ).
tff(f62,plain,
! [X1: $int,X0: list] :
( ( $less(0,count(X1,X0))
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ $less(0,count(X1,X0)) ) ),
inference(nnf_transformation,[],[f38]) ).
tff(f38,plain,
! [X1: $int,X0: list] :
( $less(0,count(X1,X0))
<=> in(X1,X0) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X1: list,X5: $int] :
( in(X5,X1)
<=> $less(0,count(X5,X1)) ),
inference(theory_normalization,[],[f14]) ).
tff(f14,axiom,
! [X1: list,X5: $int] :
( in(X5,X1)
<=> $greater(count(X5,X1),0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT089=1 : TPTP v8.1.0. Released v6.1.0.
% 0.11/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 : n016.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:44:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.47 % (16597)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.47 % (16597)Instruction limit reached!
% 0.20/0.47 % (16597)------------------------------
% 0.20/0.47 % (16597)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.47 % (16597)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.47 % (16597)Termination reason: Unknown
% 0.20/0.47 % (16597)Termination phase: Preprocessing 3
% 0.20/0.47
% 0.20/0.47 % (16597)Memory used [KB]: 895
% 0.20/0.47 % (16597)Time elapsed: 0.003 s
% 0.20/0.47 % (16597)Instructions burned: 2 (million)
% 0.20/0.47 % (16597)------------------------------
% 0.20/0.47 % (16597)------------------------------
% 0.20/0.48 % (16593)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.48 % (16589)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.48 % (16602)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.49 % (16589)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.20/0.49 % (16589)Terminated due to inappropriate strategy.
% 0.20/0.49 % (16589)------------------------------
% 0.20/0.49 % (16589)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.49 % (16589)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.49 % (16589)Termination reason: Inappropriate
% 0.20/0.49
% 0.20/0.49 % (16589)Memory used [KB]: 895
% 0.20/0.49 % (16589)Time elapsed: 0.006 s
% 0.20/0.49 % (16589)Instructions burned: 4 (million)
% 0.20/0.49 % (16589)------------------------------
% 0.20/0.49 % (16589)------------------------------
% 0.20/0.50 % (16591)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.50 % (16609)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.50 % (16620)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.50 % (16600)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.50 % (16594)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (16613)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.51 % (16609)First to succeed.
% 0.20/0.51 % (16592)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.51 % (16609)Refutation found. Thanks to Tanya!
% 0.20/0.51 % SZS status Theorem for theBenchmark
% 0.20/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51 % (16609)------------------------------
% 0.20/0.51 % (16609)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51 % (16609)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51 % (16609)Termination reason: Refutation
% 0.20/0.51
% 0.20/0.51 % (16609)Memory used [KB]: 1151
% 0.20/0.51 % (16609)Time elapsed: 0.116 s
% 0.20/0.51 % (16609)Instructions burned: 10 (million)
% 0.20/0.51 % (16609)------------------------------
% 0.20/0.51 % (16609)------------------------------
% 0.20/0.51 % (16586)Success in time 0.166 s
%------------------------------------------------------------------------------