TSTP Solution File: DAT089_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : DAT089_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 : n014.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.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of formulae : 50 ( 23 unt; 16 typ; 0 def)
% Number of atoms : 45 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 17 ~; 9 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 100 ( 17 atm; 17 fun; 20 num; 46 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 14 >; 11 *; 0 +; 0 <<)
% Number of predicates : 6 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 13 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 69 !; 0 ?; 69 :)
% 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 ) > $int ).
tff(func_def_12,type,
sK1: ( $int * list ) > list ).
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(f365,plain,
$false,
inference(gaussian_variable_elimination,[],[f363]) ).
tff(f363,plain,
! [X2: list,X0: $int,X1: $int] : ( $sum(X0,length(X2)) != count(X1,X2) ),
inference(superposition,[],[f118,f258]) ).
tff(f258,plain,
! [X8: $int,X7: $int] : ( X7 = X8 ),
inference(evaluation,[],[f257]) ).
tff(f257,plain,
! [X8: $int,X7: $int] :
( ~ $less(0,$sum(1,0))
| ( X7 = X8 ) ),
inference(forward_demodulation,[],[f245,f81]) ).
tff(f81,plain,
0 = length(nil),
inference(cnf_transformation,[],[f7]) ).
tff(f7,axiom,
0 = length(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).
tff(f245,plain,
! [X8: $int,X7: $int] :
( ~ $less(0,$sum(1,length(nil)))
| ( X7 = X8 ) ),
inference(superposition,[],[f110,f66]) ).
tff(f66,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(f110,plain,
! [X2: list,X0: $int,X1: $int] :
( ~ $less(count(X0,X2),$sum(1,length(X2)))
| ( X0 = X1 ) ),
inference(forward_demodulation,[],[f101,f78]) ).
tff(f78,plain,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
inference(cnf_transformation,[],[f55]) ).
tff(f55,plain,
! [X0: $int,X1: list] : ( length(cons(X0,X1)) = $sum(1,length(X1)) ),
inference(rectify,[],[f42]) ).
tff(f42,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(f101,plain,
! [X2: list,X0: $int,X1: $int] :
( ( X0 = X1 )
| ~ $less(count(X0,X2),length(cons(X1,X2))) ),
inference(superposition,[],[f76,f83]) ).
tff(f83,plain,
! [X2: $int,X0: $int,X1: list] :
( ( count(X0,X1) = count(X0,cons(X2,X1)) )
| ( X0 = X2 ) ),
inference(cnf_transformation,[],[f58]) ).
tff(f58,plain,
! [X0: $int,X1: list,X2: $int] :
( ( X0 = X2 )
| ( count(X0,X1) = count(X0,cons(X2,X1)) ) ),
inference(rectify,[],[f45]) ).
tff(f45,plain,
! [X1: $int,X2: list,X0: $int] :
( ( X0 = X1 )
| ( count(X1,cons(X0,X2)) = count(X1,X2) ) ),
inference(ennf_transformation,[],[f43]) ).
tff(f43,plain,
! [X1: $int,X0: $int,X2: list] :
( ( X0 != X1 )
=> ( count(X1,cons(X0,X2)) = count(X1,X2) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X3: $int,X0: $int,X4: list,X5: $int] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_3) ).
tff(f76,plain,
! [X0: $int,X1: list] : ~ $less(count(X0,X1),length(X1)),
inference(cnf_transformation,[],[f54]) ).
tff(f54,plain,
! [X0: $int,X1: list] : ~ $less(count(X0,X1),length(X1)),
inference(rectify,[],[f39]) ).
tff(f39,plain,
! [X1: $int,X0: list] : ~ $less(count(X1,X0),length(X0)),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X1: list,X5: $int] : ~ $less(count(X5,X1),length(X1)),
inference(theory_normalization,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X1: list,X5: $int] : $greatereq(count(X5,X1),length(X1)),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X1: list,X5: $int] : $greatereq(count(X5,X1),length(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c) ).
tff(f118,plain,
! [X12: $int,X13: list] : ( count(X12,X13) != $sum(-1,length(X13)) ),
inference(constrained_resolution,[],[f113,f25]) ).
tff(f25,plain,
! [X0: $int] : ~ $less(X0,X0),
introduced(theory_axiom_147,[]) ).
tff(f113,plain,
! [X2: $int,X0: list] : $less($sum(-1,length(X0)),count(X2,X0)),
inference(forward_demodulation,[],[f107,f20]) ).
tff(f20,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_140,[]) ).
tff(f107,plain,
! [X2: $int,X0: list] : $less($sum(length(X0),-1),count(X2,X0)),
inference(evaluation,[],[f106]) ).
tff(f106,plain,
! [X2: $int,X0: list] : $less($sum(length(X0),$uminus(1)),count(X2,X0)),
inference(gaussian_variable_elimination,[],[f98]) ).
tff(f98,plain,
! [X2: $int,X0: list,X1: $int] :
( $less(X1,count(X2,X0))
| ( length(X0) != $sum(X1,1) ) ),
inference(constrained_resolution,[],[f76,f29]) ).
tff(f29,plain,
! [X0: $int,X1: $int] :
( $less(X1,$sum(X0,1))
| $less(X0,X1) ),
introduced(theory_axiom_152,[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT089=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_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Aug 29 20:22:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.47 % (26951)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.20/0.49 % (26951)First to succeed.
% 0.20/0.49 % (26943)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.20/0.49 % (26961)lrs+1_1:10_av=off:drc=off:nwc=2.0:sp=reverse_frequency:thsq=on:thsqc=64:thsql=off:i=47:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/47Mi)
% 0.20/0.49 % (26953)lrs+10_1:1_ev=force:gve=cautious:tha=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.50 % (26951)Refutation found. Thanks to Tanya!
% 0.20/0.50 % SZS status Theorem for theBenchmark
% 0.20/0.50 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.50 % (26951)------------------------------
% 0.20/0.50 % (26951)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.50 % (26951)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.50 % (26951)Termination reason: Refutation
% 0.20/0.50
% 0.20/0.50 % (26951)Memory used [KB]: 5756
% 0.20/0.50 % (26951)Time elapsed: 0.103 s
% 0.20/0.50 % (26951)Instructions burned: 9 (million)
% 0.20/0.50 % (26951)------------------------------
% 0.20/0.50 % (26951)------------------------------
% 0.20/0.50 % (26930)Success in time 0.153 s
%------------------------------------------------------------------------------