TSTP Solution File: DAT095_1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : DAT095_1 : TPTP v8.1.2. 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 : n015.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 May 1 02:18:49 EDT 2024
% Result : Theorem 0.61s 0.78s
% Output : Refutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 20
% Syntax : Number of formulae : 46 ( 15 unt; 15 typ; 0 def)
% Number of atoms : 61 ( 45 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 47 ( 17 ~; 14 |; 8 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 93 ( 0 atm; 19 fun; 21 num; 53 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 25 ( 13 >; 12 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 15 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 91 ( 83 !; 8 ?; 91 :)
% 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: ( $int * list ) > $int ).
tff(func_def_14,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(f92,plain,
$false,
inference(evaluation,[],[f88]) ).
tff(f88,plain,
$sum(1,0) = $sum(2,0),
inference(superposition,[],[f77,f53]) ).
tff(f53,plain,
! [X0: $int] : ( 0 = count(X0,nil) ),
inference(cnf_transformation,[],[f9]) ).
tff(f9,axiom,
! [X0: $int] : ( 0 = count(X0,nil) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxP3ikTle4/Vampire---4.8_16191',a) ).
tff(f77,plain,
! [X0: $int,X1: list] : ( $sum(1,count(X0,X1)) = $sum(2,count(X0,X1)) ),
inference(evaluation,[],[f76]) ).
tff(f76,plain,
! [X0: $int,X1: list] : ( $sum(1,count(X0,X1)) = $sum(1,$sum(count(X0,X1),1)) ),
inference(forward_demodulation,[],[f70,f59]) ).
tff(f59,plain,
! [X2: list,X1: $int] : ( count(X1,cons(X1,X2)) = $sum(count(X1,X2),1) ),
inference(equality_resolution,[],[f51]) ).
tff(f51,plain,
! [X2: list,X0: $int,X1: $int] :
( ( X0 != X1 )
| ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
inference(cnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: $int,X1: $int,X2: list] :
( ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) )
| ( X0 != X1 ) ),
inference(ennf_transformation,[],[f35]) ).
tff(f35,plain,
! [X0: $int,X1: $int,X2: list] :
( ( X0 = X1 )
=> ( count(X0,cons(X1,X2)) = $sum(count(X0,X2),1) ) ),
inference(rectify,[],[f11]) ).
tff(f11,axiom,
! [X0: $int,X3: $int,X4: list,X5: $int] :
( ( X0 = X3 )
=> ( count(X0,cons(X3,X4)) = $sum(count(X0,X4),1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxP3ikTle4/Vampire---4.8_16191',a_4) ).
tff(f70,plain,
! [X0: $int,X1: list] : ( $sum(1,count(X0,X1)) = $sum(1,count(X0,cons(X0,X1))) ),
inference(superposition,[],[f64,f65]) ).
tff(f65,plain,
! [X0: $int,X1: list] : ( count(X0,cons(X0,X1)) = $sum(1,count(X0,X1)) ),
inference(forward_demodulation,[],[f62,f64]) ).
tff(f62,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X0,cons(X0,X1)) = count(X0,cons(X2,cons(X0,X1))) ),
inference(resolution,[],[f55,f57]) ).
tff(f57,plain,
! [X4: $int,X5: list] : in(X4,cons(X4,X5)),
inference(equality_resolution,[],[f56]) ).
tff(f56,plain,
! [X0: $int,X4: $int,X5: list] :
( ( X0 != X4 )
| in(X0,cons(X4,X5)) ),
inference(equality_resolution,[],[f47]) ).
tff(f47,plain,
! [X0: $int,X1: list,X4: $int,X5: list] :
( ( cons(X4,X5) != X1 )
| ( X0 != X4 )
| in(X0,X1) ),
inference(cnf_transformation,[],[f34]) ).
tff(f34,plain,
! [X0: $int,X1: list] :
( in(X0,X1)
<=> ( ? [X2: $int,X3: list] :
( in(X0,X3)
& ( cons(X2,X3) = X1 ) )
| ? [X4: $int,X5: list] :
( ( X0 = X4 )
& ( cons(X4,X5) = X1 ) ) ) ),
inference(rectify,[],[f5]) ).
tff(f5,axiom,
! [X2: $int,X1: list] :
( in(X2,X1)
<=> ( ? [X3: $int,X4: list] :
( in(X2,X4)
& ( cons(X3,X4) = X1 ) )
| ? [X3: $int,X4: list] :
( ( X2 = X3 )
& ( cons(X3,X4) = X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxP3ikTle4/Vampire---4.8_16191',in_conv) ).
tff(f55,plain,
! [X2: list,X0: $int,X1: $int] :
( ~ in(X1,X2)
| ( count(X1,X2) = count(X1,cons(X0,X2)) ) ),
inference(equality_resolution,[],[f41]) ).
tff(f41,plain,
! [X2: list,X3: list,X0: $int,X1: $int] :
( ~ in(X1,X2)
| ( cons(X0,X2) != X3 )
| ( count(X1,X2) = count(X1,X3) ) ),
inference(cnf_transformation,[],[f38]) ).
tff(f38,plain,
! [X0: $int,X1: $int,X2: list,X3: list] :
( ( count(X1,X2) = count(X1,X3) )
| ( cons(X0,X2) != X3 )
| ~ in(X1,X2) ),
inference(flattening,[],[f37]) ).
tff(f37,plain,
! [X0: $int,X1: $int,X2: list,X3: list] :
( ( count(X1,X2) = count(X1,X3) )
| ( cons(X0,X2) != X3 )
| ~ in(X1,X2) ),
inference(ennf_transformation,[],[f32]) ).
tff(f32,plain,
! [X0: $int,X1: $int,X2: list,X3: list] :
( ( ( cons(X0,X2) = X3 )
& in(X1,X2) )
=> ( count(X1,X2) = count(X1,X3) ) ),
inference(flattening,[],[f31]) ).
tff(f31,plain,
~ ~ ! [X0: $int,X1: $int,X2: list,X3: list] :
( ( ( cons(X0,X2) = X3 )
& in(X1,X2) )
=> ( count(X1,X2) = count(X1,X3) ) ),
inference(rectify,[],[f16]) ).
tff(f16,negated_conjecture,
~ ~ ! [X7: $int,X5: $int,X1: list,X8: list] :
( ( ( cons(X7,X1) = X8 )
& in(X5,X1) )
=> ( count(X5,X1) = count(X5,X8) ) ),
inference(negated_conjecture,[],[f15]) ).
tff(f15,conjecture,
~ ! [X7: $int,X5: $int,X1: list,X8: list] :
( ( ( cons(X7,X1) = X8 )
& in(X5,X1) )
=> ( count(X5,X1) = count(X5,X8) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ZxP3ikTle4/Vampire---4.8_16191',c) ).
tff(f64,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X0,cons(X2,cons(X0,X1))) = $sum(1,count(X0,X1)) ),
inference(forward_demodulation,[],[f63,f19]) ).
tff(f19,plain,
! [X0: $int,X1: $int] : ( $sum(X0,X1) = $sum(X1,X0) ),
introduced(theory_axiom_135,[]) ).
tff(f63,plain,
! [X2: $int,X0: $int,X1: list] : ( $sum(count(X0,X1),1) = count(X0,cons(X2,cons(X0,X1))) ),
inference(forward_demodulation,[],[f60,f59]) ).
tff(f60,plain,
! [X2: $int,X0: $int,X1: list] : ( count(X0,cons(X0,X1)) = count(X0,cons(X2,cons(X0,X1))) ),
inference(unit_resulting_resolution,[],[f57,f55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : DAT095_1 : TPTP v8.1.2. Released v6.1.0.
% 0.10/0.10 % 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.10/0.30 % Computer : n015.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Tue Apr 30 16:53:33 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.10/0.31 This is a TF0_THM_EQU_ARI problem
% 0.16/0.31 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/tmp/tmp.ZxP3ikTle4/Vampire---4.8_16191
% 0.61/0.77 % (16303)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.61/0.77 % (16302)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.61/0.77 % (16304)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.77 % (16300)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on Vampire---4 for (2995ds/34Mi)
% 0.61/0.77 % (16301)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 Vampire---4 for (2995ds/51Mi)
% 0.61/0.77 % (16305)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.61/0.77 % (16306)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 Vampire---4 for (2995ds/83Mi)
% 0.61/0.77 % (16307)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2995ds/56Mi)
% 0.61/0.77 % (16307)Refutation not found, incomplete strategy% (16307)------------------------------
% 0.61/0.77 % (16307)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.77 % (16307)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.77
% 0.61/0.77 % (16307)Memory used [KB]: 1025
% 0.61/0.77 % (16307)Time elapsed: 0.003 s
% 0.61/0.77 % (16307)Instructions burned: 3 (million)
% 0.61/0.77 % (16307)------------------------------
% 0.61/0.77 % (16307)------------------------------
% 0.61/0.78 % (16304)Refutation not found, incomplete strategy% (16304)------------------------------
% 0.61/0.78 % (16304)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (16304)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (16304)Memory used [KB]: 1050
% 0.61/0.78 % (16304)Time elapsed: 0.004 s
% 0.61/0.78 % (16304)Instructions burned: 4 (million)
% 0.61/0.78 % (16304)------------------------------
% 0.61/0.78 % (16304)------------------------------
% 0.61/0.78 % (16300)Refutation not found, incomplete strategy% (16300)------------------------------
% 0.61/0.78 % (16300)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (16300)Termination reason: Refutation not found, incomplete strategy
% 0.61/0.78
% 0.61/0.78 % (16300)Memory used [KB]: 1062
% 0.61/0.78 % (16300)Time elapsed: 0.005 s
% 0.61/0.78 % (16300)Instructions burned: 5 (million)
% 0.61/0.78 % (16300)------------------------------
% 0.61/0.78 % (16300)------------------------------
% 0.61/0.78 % (16306)First to succeed.
% 0.61/0.78 % (16306)Refutation found. Thanks to Tanya!
% 0.61/0.78 % SZS status Theorem for Vampire---4
% 0.61/0.78 % SZS output start Proof for Vampire---4
% See solution above
% 0.61/0.78 % (16306)------------------------------
% 0.61/0.78 % (16306)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.61/0.78 % (16306)Termination reason: Refutation
% 0.61/0.78
% 0.61/0.78 % (16306)Memory used [KB]: 1057
% 0.61/0.78 % (16306)Time elapsed: 0.005 s
% 0.61/0.78 % (16306)Instructions burned: 6 (million)
% 0.61/0.78 % (16306)------------------------------
% 0.61/0.78 % (16306)------------------------------
% 0.61/0.78 % (16299)Success in time 0.466 s
% 0.61/0.78 % Vampire---4.8 exiting
%------------------------------------------------------------------------------