TSTP Solution File: DAT080_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT080_1 : TPTP v8.2.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n018.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 : Mon May 20 19:49:34 EDT 2024
% Result : Theorem 0.68s 0.84s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 38 ( 12 unt; 15 typ; 0 def)
% Number of atoms : 34 ( 13 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 17 ( 6 ~; 6 |; 0 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 80 ( 12 atm; 0 fun; 53 num; 15 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 13 >; 12 *; 0 +; 0 <<)
% Number of predicates : 7 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 16 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 23 ( 23 !; 0 ?; 23 :)
% 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,
sK0: ( $int * list ) > $int ).
tff(func_def_15,type,
sK1: ( $int * list ) > list ).
tff(func_def_16,type,
sK2: ( $int * list ) > $int ).
tff(func_def_17,type,
sK3: ( $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,
sP4: ( list * $int * list * $int ) > $o ).
tff(f93,plain,
$false,
inference(evaluation,[],[f92]) ).
tff(f92,plain,
$less(0,0),
inference(forward_demodulation,[],[f89,f50]) ).
tff(f50,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(f89,plain,
$less(0,count(4,nil)),
inference(evaluation,[],[f88]) ).
tff(f88,plain,
( $less(0,count(4,nil))
| ( 4 = 3 ) ),
inference(superposition,[],[f76,f51]) ).
tff(f51,plain,
! [X2: list,X0: $int,X1: $int] :
( ( count(X0,cons(X1,X2)) = count(X0,X2) )
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f37]) ).
tff(f37,plain,
! [X0: $int,X1: $int,X2: list] :
( ( count(X0,cons(X1,X2)) = count(X0,X2) )
| ( X0 = X1 ) ),
inference(ennf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 != X1 )
=> ( count(X0,cons(X1,X2)) = count(X0,X2) ) ),
inference(rectify,[],[f10]) ).
tff(f10,axiom,
! [X0: $int,X3: $int,X4: list,X5: $int] :
( ( X0 != X3 )
=> ( count(X0,cons(X3,X4)) = count(X0,X4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_3) ).
tff(f76,plain,
$less(0,count(4,cons(3,nil))),
inference(evaluation,[],[f75]) ).
tff(f75,plain,
( $less(0,count(4,cons(3,nil)))
| ( 4 = 2 ) ),
inference(superposition,[],[f66,f51]) ).
tff(f66,plain,
$less(0,count(4,cons(2,cons(3,nil)))),
inference(evaluation,[],[f65]) ).
tff(f65,plain,
( $less(0,count(4,cons(2,cons(3,nil))))
| ( 1 = 4 ) ),
inference(superposition,[],[f57,f51]) ).
tff(f57,plain,
$less(0,count(4,cons(1,cons(2,cons(3,nil))))),
inference(unit_resulting_resolution,[],[f38,f41]) ).
tff(f41,plain,
! [X0: $int,X1: list] :
( ~ in(X0,X1)
| $less(0,count(X0,X1)) ),
inference(cnf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> $less(0,count(X0,X1)) ),
inference(rectify,[],[f18]) ).
tff(f18,plain,
! [X5: $int,X1: list] :
( in(X5,X1)
<=> $less(0,count(X5,X1)) ),
inference(theory_normalization,[],[f14]) ).
tff(f14,axiom,
! [X5: $int,X1: list] :
( in(X5,X1)
<=> $greater(count(X5,X1),0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_8) ).
tff(f38,plain,
in(4,cons(1,cons(2,cons(3,nil)))),
inference(cnf_transformation,[],[f31]) ).
tff(f31,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/sandbox2/benchmark/theBenchmark.p',c) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.16/0.16 % Problem : DAT080_1 : TPTP v8.2.0. Released v6.1.0.
% 0.17/0.19 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.20/0.42 % Computer : n018.cluster.edu
% 0.20/0.42 % Model : x86_64 x86_64
% 0.20/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.42 % Memory : 8042.1875MB
% 0.20/0.42 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.42 % CPULimit : 300
% 0.20/0.42 % WCLimit : 300
% 0.20/0.42 % DateTime : Sun May 19 23:03:38 EDT 2024
% 0.20/0.42 % CPUTime :
% 0.20/0.42 This is a TF0_THM_EQU_ARI problem
% 0.20/0.42 Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.68/0.83 % (30149)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.68/0.83 % (30145)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.68/0.83 % (30148)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.68/0.83 % (30149)Refutation not found, incomplete strategy% (30149)------------------------------
% 0.68/0.83 % (30149)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.83 % (30149)Termination reason: Refutation not found, incomplete strategy
% 0.68/0.83
% 0.68/0.83 % (30149)Memory used [KB]: 1041
% 0.68/0.83 % (30149)Time elapsed: 0.006 s
% 0.68/0.83 % (30149)Instructions burned: 3 (million)
% 0.68/0.83 % (30149)------------------------------
% 0.68/0.83 % (30149)------------------------------
% 0.68/0.83 % (30144)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.68/0.83 % (30143)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.68/0.83 % (30148)First to succeed.
% 0.68/0.83 % (30148)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-30141"
% 0.68/0.84 % (30148)Refutation found. Thanks to Tanya!
% 0.68/0.84 % SZS status Theorem for theBenchmark
% 0.68/0.84 % SZS output start Proof for theBenchmark
% See solution above
% 0.68/0.84 % (30148)------------------------------
% 0.68/0.84 % (30148)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.68/0.84 % (30148)Termination reason: Refutation
% 0.68/0.84
% 0.68/0.84 % (30148)Memory used [KB]: 1058
% 0.68/0.84 % (30148)Time elapsed: 0.007 s
% 0.68/0.84 % (30148)Instructions burned: 6 (million)
% 0.68/0.84 % (30141)Success in time 0.408 s
% 0.68/0.84 % Vampire---4.8 exiting
%------------------------------------------------------------------------------