TSTP Solution File: DAT088_1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---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_sat --cores 0 -t %d %s
% Computer : n027.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 0.19s 0.49s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of formulae : 43 ( 14 unt; 16 typ; 0 def)
% Number of atoms : 40 ( 39 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 7 |; 0 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 58 ( 0 atm; 11 fun; 13 num; 34 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 : 56 ( 56 !; 0 ?; 56 :)
% 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: ( $int * list ) > $int ).
tff(func_def_16,type,
sK5: ( $int * list ) > list ).
tff(pred_def_1,type,
in: ( $int * list ) > $o ).
tff(pred_def_2,type,
inRange: ( $int * list ) > $o ).
tff(f99,plain,
$false,
inference(evaluation,[],[f98]) ).
tff(f98,plain,
0 = $sum(1,0),
inference(superposition,[],[f96,f63]) ).
tff(f63,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(f96,plain,
! [X2: $int,X0: list] : ( $sum(1,count(X2,X0)) = count(X2,X0) ),
inference(backward_demodulation,[],[f92,f95]) ).
tff(f95,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X2,cons(X0,X1)) = count(X2,X1) ),
inference(subsumption_resolution,[],[f94,f66]) ).
tff(f66,plain,
! [X0: list,X1: $int] : ( nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f46]) ).
tff(f46,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/sandbox/benchmark/theBenchmark.p',l4) ).
tff(f94,plain,
! [X2: $int,X0: $int,X1: list] :
( ( count(X2,cons(X0,X1)) = count(X2,X1) )
| ( cons(X0,X1) = nil ) ),
inference(superposition,[],[f69,f60]) ).
tff(f60,plain,
! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f2]) ).
tff(f2,axiom,
! [X0: $int,X1: list] : ( tail(cons(X0,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).
tff(f69,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] :
( ( nil = X1 )
| ( count(X0,X1) = count(X0,tail(X1)) ) ),
inference(rectify,[],[f44]) ).
tff(f44,plain,
! [X1: $int,X0: list] :
( ( nil = X0 )
| ( count(X1,tail(X0)) = count(X1,X0) ) ),
inference(ennf_transformation,[],[f34]) ).
tff(f34,plain,
! [X1: $int,X0: list] :
( ( nil != X0 )
=> ( count(X1,tail(X0)) = count(X1,X0) ) ),
inference(flattening,[],[f33]) ).
tff(f33,plain,
~ ~ ! [X1: $int,X0: list] :
( ( nil != X0 )
=> ( count(X1,tail(X0)) = count(X1,X0) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X1: list,X5: $int] :
( ( nil != X1 )
=> ( count(X5,X1) = count(X5,tail(X1)) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X1: list,X5: $int] :
( ( nil != X1 )
=> ( count(X5,X1) = count(X5,tail(X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f92,plain,
! [X2: $int,X0: list] : ( $sum(1,count(X2,X0)) = count(X2,cons(X2,X0)) ),
inference(backward_demodulation,[],[f89,f19]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $sum(X1,X0) = $sum(X0,X1) ),
introduced(theory_axiom_140,[]) ).
tff(f89,plain,
! [X2: $int,X0: list] : ( $sum(count(X2,X0),1) = count(X2,cons(X2,X0)) ),
inference(equality_resolution,[],[f77]) ).
tff(f77,plain,
! [X2: $int,X0: list,X1: $int] :
( ( $sum(count(X2,X0),1) = count(X2,cons(X1,X0)) )
| ( X1 != X2 ) ),
inference(cnf_transformation,[],[f54]) ).
tff(f54,plain,
! [X0: list,X1: $int,X2: $int] :
( ( $sum(count(X2,X0),1) = count(X2,cons(X1,X0)) )
| ( X1 != X2 ) ),
inference(rectify,[],[f43]) ).
tff(f43,plain,
! [X1: list,X0: $int,X2: $int] :
( ( count(X2,cons(X0,X1)) = $sum(count(X2,X1),1) )
| ( X0 != X2 ) ),
inference(ennf_transformation,[],[f39]) ).
tff(f39,plain,
! [X2: $int,X0: $int,X1: list] :
( ( X0 = X2 )
=> ( count(X2,cons(X0,X1)) = $sum(count(X2,X1),1) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X3: $int,X4: list,X0: $int,X5: $int] :
( ( X0 = X3 )
=> ( count(X0,cons(X3,X4)) = $sum(count(X0,X4),1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_4) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : DAT088=1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.12 % 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.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Aug 29 20:36:30 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.46 % (20667)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.48 % (20690)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.19/0.48 % (20690)First to succeed.
% 0.19/0.49 % (20672)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.49 % (20690)Refutation found. Thanks to Tanya!
% 0.19/0.49 % SZS status Theorem for theBenchmark
% 0.19/0.49 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.49 % (20690)------------------------------
% 0.19/0.49 % (20690)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.49 % (20690)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.49 % (20690)Termination reason: Refutation
% 0.19/0.49
% 0.19/0.49 % (20690)Memory used [KB]: 1023
% 0.19/0.49 % (20690)Time elapsed: 0.110 s
% 0.19/0.49 % (20690)Instructions burned: 4 (million)
% 0.19/0.49 % (20690)------------------------------
% 0.19/0.49 % (20690)------------------------------
% 0.19/0.49 % (20660)Success in time 0.148 s
%------------------------------------------------------------------------------