TSTP Solution File: DAT080_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT080_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 : n002.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:07 EDT 2022
% Result : Theorem 0.14s 0.48s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 22
% Syntax : Number of formulae : 43 ( 12 unt; 18 typ; 0 def)
% Number of atoms : 40 ( 15 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 23 ( 8 ~; 9 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 87 ( 14 atm; 0 fun; 55 num; 18 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 29 ( 16 >; 13 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?; 28 :)
% 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_14,type,
sK2: ( $int * list ) > $int ).
tff(func_def_15,type,
sK3: ( $int * list ) > list ).
tff(func_def_16,type,
sK4: ( $int * list ) > list ).
tff(func_def_17,type,
sK5: ( $int * list ) > $int ).
tff(func_def_18,type,
sK6: ( $int * list ) > $int ).
tff(func_def_19,type,
sK7: ( $int * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(pred_def_6,type,
sP0: ( $int * list ) > $o ).
tff(pred_def_7,type,
sP1: ( $int * list ) > $o ).
tff(f156,plain,
$false,
inference(evaluation,[],[f155]) ).
tff(f155,plain,
$less(0,0),
inference(forward_demodulation,[],[f154,f67]) ).
tff(f67,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: $int] : ( 0 = count(X0,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a) ).
tff(f154,plain,
$less(0,count(4,nil)),
inference(evaluation,[],[f152]) ).
tff(f152,plain,
( $less(0,count(4,nil))
| ( 4 = 3 ) ),
inference(superposition,[],[f144,f82]) ).
tff(f82,plain,
! [X2: $int,X0: $int,X1: list] :
( ( count(X0,cons(X2,X1)) = count(X0,X1) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f57]) ).
tff(f57,plain,
! [X0: $int,X1: list,X2: $int] :
( ( X0 = X2 )
| ( count(X0,cons(X2,X1)) = count(X0,X1) ) ),
inference(rectify,[],[f41]) ).
tff(f41,plain,
! [X3: $int,X0: list,X2: $int] :
( ( X2 = X3 )
| ( count(X3,X0) = count(X3,cons(X2,X0)) ) ),
inference(ennf_transformation,[],[f31]) ).
tff(f31,plain,
! [X3: $int,X0: list,X2: $int] :
( ( X2 != X3 )
=> ( count(X3,X0) = count(X3,cons(X2,X0)) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X4: list,X5: $int,X3: $int,X0: $int] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_3) ).
tff(f144,plain,
$less(0,count(4,cons(3,nil))),
inference(evaluation,[],[f142]) ).
tff(f142,plain,
( $less(0,count(4,cons(3,nil)))
| ( 4 = 2 ) ),
inference(superposition,[],[f137,f82]) ).
tff(f137,plain,
$less(0,count(4,cons(2,cons(3,nil)))),
inference(evaluation,[],[f135]) ).
tff(f135,plain,
( ( 1 = 4 )
| $less(0,count(4,cons(2,cons(3,nil)))) ),
inference(superposition,[],[f104,f82]) ).
tff(f104,plain,
$less(0,count(4,cons(1,cons(2,cons(3,nil))))),
inference(resolution,[],[f93,f94]) ).
tff(f94,plain,
! [X0: list,X1: $int] :
( ~ in(X1,X0)
| $less(0,count(X1,X0)) ),
inference(cnf_transformation,[],[f66]) ).
tff(f66,plain,
! [X0: list,X1: $int] :
( ( in(X1,X0)
| ~ $less(0,count(X1,X0)) )
& ( $less(0,count(X1,X0))
| ~ in(X1,X0) ) ),
inference(nnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X0: list,X1: $int] :
( in(X1,X0)
<=> $less(0,count(X1,X0)) ),
inference(rectify,[],[f17]) ).
tff(f17,plain,
! [X1: list,X5: $int] :
( $less(0,count(X5,X1))
<=> in(X5,X1) ),
inference(theory_normalization,[],[f14]) ).
tff(f14,axiom,
! [X1: list,X5: $int] :
( $greater(count(X5,X1),0)
<=> in(X5,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_8) ).
tff(f93,plain,
in(4,cons(1,cons(2,cons(3,nil)))),
inference(cnf_transformation,[],[f40]) ).
tff(f40,plain,
in(4,cons(1,cons(2,cons(3,nil)))),
inference(flattening,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ in(4,cons(1,cons(2,cons(3,nil)))),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ in(4,cons(1,cons(2,cons(3,nil)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : DAT080=1 : TPTP v8.1.0. Released v6.1.0.
% 0.05/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.30 % Computer : n002.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Aug 29 20:33:13 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.46 % (3330)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.14/0.46 % (3347)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 % (3339)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 % (3339)Instruction limit reached!
% 0.14/0.47 % (3339)------------------------------
% 0.14/0.47 % (3339)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.47 % (3339)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.47 % (3339)Termination reason: Unknown
% 0.14/0.47 % (3339)Termination phase: Property scanning
% 0.14/0.47
% 0.14/0.47 % (3339)Memory used [KB]: 1023
% 0.14/0.47 % (3339)Time elapsed: 0.006 s
% 0.14/0.47 % (3339)Instructions burned: 3 (million)
% 0.14/0.47 % (3339)------------------------------
% 0.14/0.47 % (3339)------------------------------
% 0.14/0.47 % (3347)First to succeed.
% 0.14/0.47 % (3346)dis+2_1:1_av=off:bsr=on:erd=off:s2pl=on:sgt=16:sos=on:sp=frequency:ss=axioms:i=46:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/46Mi)
% 0.14/0.48 % (3347)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 % (3347)------------------------------
% 0.14/0.48 % (3347)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.14/0.48 % (3347)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.14/0.48 % (3347)Termination reason: Refutation
% 0.14/0.48
% 0.14/0.48 % (3347)Memory used [KB]: 5500
% 0.14/0.48 % (3347)Time elapsed: 0.065 s
% 0.14/0.48 % (3347)Instructions burned: 5 (million)
% 0.14/0.48 % (3347)------------------------------
% 0.14/0.48 % (3347)------------------------------
% 0.14/0.48 % (3323)Success in time 0.173 s
%------------------------------------------------------------------------------