TSTP Solution File: DAT088_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT088_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 : n005.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:08 EDT 2022
% Result : Theorem 0.16s 0.49s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 21
% Syntax : Number of formulae : 41 ( 13 unt; 16 typ; 0 def)
% Number of atoms : 37 ( 36 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 27 ( 15 ~; 6 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 51 ( 0 atm; 8 fun; 12 num; 31 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 52 ( 52 !; 0 ?; 52 :)
% 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 ) > list ).
tff(func_def_12,type,
sK1: ( list * $int ) > $int ).
tff(func_def_13,type,
sK2: ( list * $int ) > $int ).
tff(func_def_14,type,
sK3: ( list * $int ) > list ).
tff(func_def_15,type,
sK4: ( list * $int ) > list ).
tff(func_def_16,type,
sK5: ( list * $int ) > $int ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f125,plain,
$false,
inference(evaluation,[],[f111]) ).
tff(f111,plain,
0 = $sum(0,1),
inference(superposition,[],[f105,f75]) ).
tff(f75,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(f105,plain,
! [X0: $int,X1: list] : ( $sum(count(X0,X1),1) = count(X0,X1) ),
inference(superposition,[],[f89,f98]) ).
tff(f98,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X2,cons(X0,X1)) = count(X2,X1) ),
inference(subsumption_resolution,[],[f95,f76]) ).
tff(f76,plain,
! [X0: list,X1: $int] : ( nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: list,X1: $int] : ( nil != cons(X1,X0) ),
inference(rectify,[],[f4]) ).
tff(f4,axiom,
! [X1: list,X0: $int] : ( cons(X0,X1) != nil ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4) ).
tff(f95,plain,
! [X2: $int,X0: $int,X1: list] :
( ( cons(X0,X1) = nil )
| ( count(X2,cons(X0,X1)) = count(X2,X1) ) ),
inference(superposition,[],[f77,f88]) ).
tff(f88,plain,
! [X0: list,X1: $int] : ( tail(cons(X1,X0)) = X0 ),
inference(cnf_transformation,[],[f41]) ).
tff(f41,plain,
! [X0: list,X1: $int] : ( tail(cons(X1,X0)) = X0 ),
inference(rectify,[],[f2]) ).
tff(f2,axiom,
! [X1: list,X0: $int] : ( tail(cons(X0,X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2) ).
tff(f77,plain,
! [X0: $int,X1: list] :
( ( count(X0,X1) = count(X0,tail(X1)) )
| ( nil = X1 ) ),
inference(cnf_transformation,[],[f47]) ).
tff(f47,plain,
! [X0: $int,X1: list] :
( ( count(X0,X1) = count(X0,tail(X1)) )
| ( nil = X1 ) ),
inference(ennf_transformation,[],[f37]) ).
tff(f37,plain,
! [X1: list,X0: $int] :
( ( nil != X1 )
=> ( count(X0,X1) = count(X0,tail(X1)) ) ),
inference(flattening,[],[f36]) ).
tff(f36,plain,
~ ~ ! [X1: list,X0: $int] :
( ( nil != X1 )
=> ( count(X0,X1) = count(X0,tail(X1)) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X5: $int,X1: list] :
( ( nil != X1 )
=> ( count(X5,X1) = count(X5,tail(X1)) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X5: $int,X1: list] :
( ( nil != X1 )
=> ( count(X5,X1) = count(X5,tail(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f89,plain,
! [X2: $int,X0: list] : ( $sum(count(X2,X0),1) = count(X2,cons(X2,X0)) ),
inference(equality_resolution,[],[f64]) ).
tff(f64,plain,
! [X2: $int,X0: list,X1: $int] :
( ( X1 != X2 )
| ( $sum(count(X2,X0),1) = count(X2,cons(X1,X0)) ) ),
inference(cnf_transformation,[],[f48]) ).
tff(f48,plain,
! [X0: list,X1: $int,X2: $int] :
( ( X1 != X2 )
| ( $sum(count(X2,X0),1) = count(X2,cons(X1,X0)) ) ),
inference(rectify,[],[f46]) ).
tff(f46,plain,
! [X1: list,X2: $int,X3: $int] :
( ( X2 != X3 )
| ( count(X3,cons(X2,X1)) = $sum(count(X3,X1),1) ) ),
inference(ennf_transformation,[],[f35]) ).
tff(f35,plain,
! [X3: $int,X2: $int,X1: list] :
( ( X2 = X3 )
=> ( count(X3,cons(X2,X1)) = $sum(count(X3,X1),1) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X5: $int,X4: list,X3: $int,X0: $int] :
( ( X0 = X3 )
=> ( count(X0,cons(X3,X4)) = $sum(count(X0,X4),1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : DAT088=1 : TPTP v8.1.0. Released v6.1.0.
% 0.05/0.11 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.11/0.31 % Computer : n005.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Aug 29 20:21:18 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.16/0.46 % (31925)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.16/0.46 % (31926)lrs+1010_1:1_bd=off:fd=off:fde=none:ins=3:sac=on:sos=on:spb=goal:to=lpo:i=36:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/36Mi)
% 0.16/0.48 % (31926)First to succeed.
% 0.16/0.48 % (31941)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.16/0.48 % (31942)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.16/0.48 % (31933)lrs+22_1:1_amm=sco:fsr=off:gve=force:sos=on:uwa=all:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.16/0.49 % (31926)Refutation found. Thanks to Tanya!
% 0.16/0.49 % SZS status Theorem for theBenchmark
% 0.16/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.49 % (31926)------------------------------
% 0.16/0.49 % (31926)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.49 % (31926)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.49 % (31926)Termination reason: Refutation
% 0.16/0.49
% 0.16/0.49 % (31926)Memory used [KB]: 5500
% 0.16/0.49 % (31926)Time elapsed: 0.115 s
% 0.16/0.49 % (31926)Instructions burned: 5 (million)
% 0.16/0.49 % (31926)------------------------------
% 0.16/0.49 % (31926)------------------------------
% 0.16/0.49 % (31918)Success in time 0.168 s
%------------------------------------------------------------------------------