TSTP Solution File: DAT084_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : DAT084_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 : n012.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:51 EDT 2022
% Result : Theorem 1.41s 0.54s
% Output : Refutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 23
% Syntax : Number of formulae : 36 ( 17 unt; 17 typ; 0 def)
% Number of atoms : 21 ( 14 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 43 ( 6 atm; 10 fun; 16 num; 11 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 15 !; 5 ?; 20 :)
% 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: ( $int * list ) > list ).
tff(func_def_12,type,
sK1: ( $int * list ) > $int ).
tff(func_def_13,type,
sK2: ( $int * list ) > $int ).
tff(func_def_14,type,
sK3: ( $int * list ) > list ).
tff(func_def_15,type,
sK4: list ).
tff(func_def_16,type,
sK5: ( list * $int ) > list ).
tff(func_def_17,type,
sK6: ( list * $int ) > $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f193,plain,
$false,
inference(subsumption_resolution,[],[f192,f24]) ).
tff(f24,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f192,plain,
$less(length(sK4),length(sK4)),
inference(superposition,[],[f130,f189]) ).
tff(f189,plain,
length(sK4) = $sum(1,length(sK4)),
inference(superposition,[],[f71,f76]) ).
tff(f76,plain,
length(sK4) = length(cons(1,sK4)),
inference(cnf_transformation,[],[f54]) ).
tff(f54,plain,
length(sK4) = length(cons(1,sK4)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4])],[f32,f53]) ).
tff(f53,plain,
( ? [X0: list] : ( length(X0) = length(cons(1,X0)) )
=> ( length(sK4) = length(cons(1,sK4)) ) ),
introduced(choice_axiom,[]) ).
tff(f32,plain,
? [X0: list] : ( length(X0) = length(cons(1,X0)) ),
inference(flattening,[],[f31]) ).
tff(f31,plain,
~ ~ ? [X0: list] : ( length(X0) = length(cons(1,X0)) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ? [X1: list] : ( length(X1) = length(cons(1,X1)) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ? [X1: list] : ( length(X1) = length(cons(1,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f71,plain,
! [X0: $int,X1: list] : ( $sum(1,length(X1)) = length(cons(X0,X1)) ),
inference(cnf_transformation,[],[f51]) ).
tff(f51,plain,
! [X0: $int,X1: list] : ( $sum(1,length(X1)) = length(cons(X0,X1)) ),
inference(rectify,[],[f34]) ).
tff(f34,plain,
! [X1: $int,X0: list] : ( $sum(1,length(X0)) = length(cons(X1,X0)) ),
inference(rectify,[],[f8]) ).
tff(f8,axiom,
! [X4: list,X3: $int] : ( length(cons(X3,X4)) = $sum(1,length(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l_1) ).
tff(f130,plain,
! [X0: $int] : $less(X0,$sum(1,X0)),
inference(superposition,[],[f115,f19]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f115,plain,
! [X0: $int] : $less(X0,$sum(X0,1)),
inference(resolution,[],[f28,f24]) ).
tff(f28,plain,
! [X0: $int,X1: $int] :
( $less(X0,X1)
| $less(X1,$sum(X0,1)) ),
introduced(theory_axiom_152,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT084=1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/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.14/0.34 % Computer : n012.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 29 20:20:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.21/0.51 % (9867)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.21/0.51 % (9859)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.21/0.52 % (9858)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 1.41/0.53 % (9873)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 1.41/0.53 % (9848)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)
% 1.41/0.53 % (9847)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)
% 1.41/0.53 % (9849)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.41/0.53 % (9851)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.41/0.53 % (9850)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)
% 1.41/0.53 % (9867)First to succeed.
% 1.41/0.53 % (9851)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 1.41/0.53 % (9851)Terminated due to inappropriate strategy.
% 1.41/0.53 % (9851)------------------------------
% 1.41/0.53 % (9851)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.53 % (9851)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.53 % (9851)Termination reason: Inappropriate
% 1.41/0.53
% 1.41/0.53 % (9851)Memory used [KB]: 895
% 1.41/0.53 % (9851)Time elapsed: 0.004 s
% 1.41/0.53 % (9851)Instructions burned: 3 (million)
% 1.41/0.53 % (9851)------------------------------
% 1.41/0.53 % (9851)------------------------------
% 1.41/0.54 % (9853)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.41/0.54 % (9862)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 1.41/0.54 % (9867)Refutation found. Thanks to Tanya!
% 1.41/0.54 % SZS status Theorem for theBenchmark
% 1.41/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.41/0.54 % (9867)------------------------------
% 1.41/0.54 % (9867)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.54 % (9867)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.54 % (9867)Termination reason: Refutation
% 1.41/0.54
% 1.41/0.54 % (9867)Memory used [KB]: 1023
% 1.41/0.54 % (9867)Time elapsed: 0.080 s
% 1.41/0.54 % (9867)Instructions burned: 7 (million)
% 1.41/0.54 % (9867)------------------------------
% 1.41/0.54 % (9867)------------------------------
% 1.41/0.54 % (9844)Success in time 0.182 s
%------------------------------------------------------------------------------