TSTP Solution File: DAT098_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : DAT098_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n019.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 : Sun May 5 05:06:01 EDT 2024
% Result : Theorem 0.21s 0.42s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 13
% Syntax : Number of formulae : 40 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 121 ( 28 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 144 ( 54 ~; 45 |; 39 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 134 ( 38 atm; 0 fun; 66 num; 30 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 12 ( 7 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 6 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 42 !; 16 ?; 58 :)
% 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,
sK1: ( $int * list ) > $int ).
tff(func_def_12,type,
sK2: ( $int * list ) > list ).
tff(pred_def_1,type,
inRange: ( $int * list ) > $o ).
tff(pred_def_4,type,
sP0: ( $int * list ) > $o ).
tff(f1136,plain,
$false,
inference(resolution,[],[f1135,f46]) ).
tff(f46,plain,
! [X0: $int] : sP0(X0,nil),
inference(equality_resolution,[],[f41]) ).
tff(f41,plain,
! [X0: $int,X1: list] :
( sP0(X0,X1)
| ( nil != X1 ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f30,plain,
! [X0: $int,X1: list] :
( ( sP0(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) )
& ( nil != X1 ) ) )
& ( ( inRange(X0,sK2(X0,X1))
& $less(sK1(X0,X1),X0)
& ~ $less(sK1(X0,X1),0)
& ( cons(sK1(X0,X1),sK2(X0,X1)) = X1 ) )
| ( nil = X1 )
| ~ sP0(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f28,f29]) ).
tff(f29,plain,
! [X0: $int,X1: list] :
( ? [X4: $int,X5: list] :
( inRange(X0,X5)
& $less(X4,X0)
& ~ $less(X4,0)
& ( cons(X4,X5) = X1 ) )
=> ( inRange(X0,sK2(X0,X1))
& $less(sK1(X0,X1),X0)
& ~ $less(sK1(X0,X1),0)
& ( cons(sK1(X0,X1),sK2(X0,X1)) = X1 ) ) ),
introduced(choice_axiom,[]) ).
tff(f28,plain,
! [X0: $int,X1: list] :
( ( sP0(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) )
& ( nil != X1 ) ) )
& ( ? [X4: $int,X5: list] :
( inRange(X0,X5)
& $less(X4,X0)
& ~ $less(X4,0)
& ( cons(X4,X5) = X1 ) )
| ( nil = X1 )
| ~ sP0(X0,X1) ) ),
inference(rectify,[],[f27]) ).
tff(f27,plain,
! [X0: $int,X1: list] :
( ( sP0(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) )
& ( nil != X1 ) ) )
& ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 )
| ~ sP0(X0,X1) ) ),
inference(flattening,[],[f26]) ).
tff(f26,plain,
! [X0: $int,X1: list] :
( ( sP0(X0,X1)
| ( ! [X2: $int,X3: list] :
( ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) )
& ( nil != X1 ) ) )
& ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 )
| ~ sP0(X0,X1) ) ),
inference(nnf_transformation,[],[f24]) ).
tff(f24,plain,
! [X0: $int,X1: list] :
( sP0(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = X1 ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f1135,plain,
~ sP0(4,nil),
inference(resolution,[],[f1134,f44]) ).
tff(f44,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f31]) ).
tff(f31,plain,
! [X0: $int,X1: list] :
( ( inRange(X0,X1)
| ~ sP0(X0,X1) )
& ( sP0(X0,X1)
| ~ inRange(X0,X1) ) ),
inference(nnf_transformation,[],[f25]) ).
tff(f25,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> sP0(X0,X1) ),
inference(definition_folding,[],[f23,f24]) ).
tff(f23,plain,
! [X0: $int,X1: list] :
( inRange(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( inRange(X0,X3)
& $less(X2,X0)
& ~ $less(X2,0)
& ( cons(X2,X3) = X1 ) )
| ( nil = 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/sandbox/benchmark/theBenchmark.p',inRange) ).
tff(f1134,plain,
~ inRange(4,nil),
inference(evaluation,[],[f1132]) ).
tff(f1132,plain,
( ~ inRange(4,nil)
| ~ $less(2,4)
| $less(2,0) ),
inference(resolution,[],[f1131,f45]) ).
tff(f45,plain,
! [X2: $int,X3: list,X0: $int] :
( sP0(X0,cons(X2,X3))
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0) ),
inference(equality_resolution,[],[f42]) ).
tff(f42,plain,
! [X2: $int,X3: list,X0: $int,X1: list] :
( sP0(X0,X1)
| ~ inRange(X0,X3)
| ~ $less(X2,X0)
| $less(X2,0)
| ( cons(X2,X3) != X1 ) ),
inference(cnf_transformation,[],[f30]) ).
tff(f1131,plain,
~ sP0(4,cons(2,nil)),
inference(resolution,[],[f1130,f44]) ).
tff(f1130,plain,
~ inRange(4,cons(2,nil)),
inference(evaluation,[],[f1128]) ).
tff(f1128,plain,
( ~ inRange(4,cons(2,nil))
| ~ $less(3,4)
| $less(3,0) ),
inference(resolution,[],[f1127,f45]) ).
tff(f1127,plain,
~ sP0(4,cons(3,cons(2,nil))),
inference(resolution,[],[f1126,f44]) ).
tff(f1126,plain,
~ inRange(4,cons(3,cons(2,nil))),
inference(evaluation,[],[f1123]) ).
tff(f1123,plain,
( ~ inRange(4,cons(3,cons(2,nil)))
| ~ $less(1,4)
| $less(1,0) ),
inference(resolution,[],[f45,f48]) ).
tff(f48,plain,
~ sP0(4,cons(1,cons(3,cons(2,nil)))),
inference(resolution,[],[f44,f32]) ).
tff(f32,plain,
~ inRange(4,cons(1,cons(3,cons(2,nil)))),
inference(cnf_transformation,[],[f21]) ).
tff(f21,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/sandbox/benchmark/theBenchmark.p',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.15 % Problem : DAT098_1 : TPTP v8.1.2. Released v6.1.0.
% 0.13/0.16 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.37 % Computer : n019.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Fri May 3 12:50:59 EDT 2024
% 0.14/0.38 % CPUTime :
% 0.14/0.38 % (24294)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.40 % (24297)WARNING: value z3 for option sas not known
% 0.21/0.40 % (24295)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.40 % (24295)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.40 % (24295)Terminated due to inappropriate strategy.
% 0.21/0.40 % (24295)------------------------------
% 0.21/0.40 % (24295)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40 % (24295)Termination reason: Inappropriate
% 0.21/0.40
% 0.21/0.40 % (24295)Memory used [KB]: 730
% 0.21/0.40 % (24295)Time elapsed: 0.003 s
% 0.21/0.40 % (24295)Instructions burned: 2 (million)
% 0.21/0.40 % (24298)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.40 % (24296)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.40 % (24299)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.21/0.40 % (24295)------------------------------
% 0.21/0.40 % (24295)------------------------------
% 0.21/0.40 % (24297)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.21/0.40 % (24300)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.21/0.40 % (24301)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.21/0.40 % (24298)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.40 % (24298)Terminated due to inappropriate strategy.
% 0.21/0.40 % (24298)------------------------------
% 0.21/0.40 % (24298)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40 % (24296)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.40 % (24298)Termination reason: Inappropriate
% 0.21/0.40
% 0.21/0.40 % (24298)Memory used [KB]: 730
% 0.21/0.40 % (24298)Time elapsed: 0.003 s
% 0.21/0.40 % (24298)Instructions burned: 2 (million)
% 0.21/0.40 % (24296)Terminated due to inappropriate strategy.
% 0.21/0.40 % (24296)------------------------------
% 0.21/0.40 % (24296)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40 % (24296)Termination reason: Inappropriate
% 0.21/0.40
% 0.21/0.40 % (24296)Memory used [KB]: 730
% 0.21/0.40 % (24296)Time elapsed: 0.003 s
% 0.21/0.40 % (24296)Instructions burned: 2 (million)
% 0.21/0.40 % (24298)------------------------------
% 0.21/0.40 % (24298)------------------------------
% 0.21/0.40 % (24296)------------------------------
% 0.21/0.40 % (24296)------------------------------
% 0.21/0.41 % (24302)fmb+10_1_fmbas=expand:fmbsr=1.1:gsp=on:nm=4_411 on theBenchmark for (411ds/0Mi)
% 0.21/0.41 % (24302)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.21/0.41 % (24302)Terminated due to inappropriate strategy.
% 0.21/0.41 % (24302)------------------------------
% 0.21/0.41 % (24302)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.41 % (24302)Termination reason: Inappropriate
% 0.21/0.41
% 0.21/0.41 % (24302)Memory used [KB]: 729
% 0.21/0.41 % (24302)Time elapsed: 0.002 s
% 0.21/0.41 % (24302)Instructions burned: 2 (million)
% 0.21/0.41 % (24302)------------------------------
% 0.21/0.41 % (24302)------------------------------
% 0.21/0.41 % (24303)ott+1_9_av=off:bd=off:bs=on:gsp=on:lcm=predicate:nm=4:sp=weighted_frequency:urr=on_382 on theBenchmark for (382ds/0Mi)
% 0.21/0.41 % (24304)lrs-11_2:5_fsd=off:fde=none:nm=4:nwc=5.0:sims=off:sp=reverse_weighted_frequency:stl=62_367 on theBenchmark for (367ds/0Mi)
% 0.21/0.42 % (24300)First to succeed.
% 0.21/0.42 % (24300)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-24294"
% 0.21/0.42 % (24300)Refutation found. Thanks to Tanya!
% 0.21/0.42 % SZS status Theorem for theBenchmark
% 0.21/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.42 % (24300)------------------------------
% 0.21/0.42 % (24300)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.42 % (24300)Termination reason: Refutation
% 0.21/0.42
% 0.21/0.42 % (24300)Memory used [KB]: 1163
% 0.21/0.42 % (24300)Time elapsed: 0.022 s
% 0.21/0.42 % (24300)Instructions burned: 32 (million)
% 0.21/0.42 % (24294)Success in time 0.035 s
%------------------------------------------------------------------------------